检索结果-内蒙古大学图书馆

3rd international workshop on Meta-programming in logic, META 1992

3rd international workshop on Meta-programming in logic, META 1992

ISBN: (纸本)9783540562825

The proceedings contain 23 papers. The special focus in this conference is on Meta-programming in logic. The topics include: A vade-mecum;metaprogramming through intensional deduction;an autoepistemic analysis of metalevel reasoning in logic programming;an introduction to partial deduction;tutorial on termination of logic programs;definable naming relations in meta-level systems;meta for modularising logic programming;an application of meta-level prolog primitives;reflective agents in metalogic programming;logic meta-programming facilities in 'LOG the pandora deadlock handler meta-level relation;an experiment;a sensible least herbrand semantics for untyped vanilla meta-programming and its extension to a limited form of amalgamation;a complete resolution method for logical meta-programming languages;model theoretic semantics for demo;intuitions, proof theory and semantics;negation and control in automatically generated logic programs;transforming normal programs by replacement;meta-programming for reordering literals in deductive databases;a new operation in a framework for abstract interpretation of logic programs;representation of fragmentary multilayered knowledge and metaprograms for change, assumptions, objects, and inheritance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

logic programming and knowledge representation - Third international workshop, lpkr'97, Selected Papers

Logic Programming and Knowledge Representation - Third Inter...

引用

3rd international workshop on logic programming and knowledge representation, lpkr 1997

ISBN: (纸本)3540649581

The proceedings contain 9 papers. The topics discussed include: knowledge representation with logic programs;DATALOG with nested rules;partial evidential stable models for disjunctive deductive databases;disjunctive logic programming and autoepistemic logic;a system for abductive learning of logic programs;refining action theories through abductive logic programming;abduction, argumentation and bi-disjunctive logic programs;reasoning with prioritized defaults;and generalizing updates: from models to programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using background knowledge to build multistrategy learners

引用

MACHINE LEARNING 1997年第3期27卷 241-257页

作者： Sammut, C School of Computer Science and Engineering University of New South Wales Sydney Australia

This paper discusses the role that background knowledge can play in building flexible multistrategy learning systems. We contend that a variety of learning strategies can be embodied in the background knowledge provided to a general purpose learning algorithm. To be effective, the general purpose algorithm must have a mechanism for learning new concept descriptions that can refer to knowledge provided by the user or learned during some other task. The method of knowledge representation is a central problem in designing such a system since it should be possible to specify background knowledge in such a way that the learner can apply its knowledge to new information.

关键词： multistrategy learning inductive logic programming background knowledge knowledge representation

来源：评论

学校读者我要写书评

暂无评论

A multistrategy approach to relational knowledge discovery in databases

引用

MACHINE LEARNING 1997年第3期27卷 287-312页

作者： Morik, K Brockhausen, P Computer Science Department LS VIII Univ. Dortmund Dortmund

When learning from very large databases, the reduction of complexity is extremely important. Two extremes of making knowledge discovery in databases (KDD) feasible have been put forward. One extreme is to choose a very simple hypothesis language, thereby being capable of very fast learning on real-world databases. The opposite extreme is to select a small data set, thereby being able to learn very expressive (first-order logic) hypotheses. A multistrategy approach allows one to include most of these advantages and exclude most of the disadvantages. Simpler learning algorithms detect hierarchies which are used to structure the hypothesis space for a more complex learning algorithm. The better structured the hypothesis space is, the better learning can prune away uninteresting or losing hypotheses and the faster it becomes. We have combined inductive logic programming (ILP) directly with a relational database management system. The ILP algorithm is controlled in a model-driven way by the user and in a data-driven way by structures that are induced by three simple learning algorithms.

关键词： knowledge discovery in databases inductive logic programming functional dependencies numerical intervals background knowledge

来源：评论

学校读者我要写书评

暂无评论

A sound and complete algorithm for simple conceptual logic programs

A sound and complete algorithm for simple conceptual logic p...

引用

3rd international workshop on Applications of logic programming to the (Semantic) Web and Web Services, ALPSWS 2008 - Co-located with the 24th international Conference on logic programming, ICLP 2008

作者： Feier, Cristina Heymans, Stijn Knowledge-Based Systems Group Institute of Information Systems Vienna University of Technology Favoritenstrasse 9-11 A-1040 Vienna Austria

Open Answer Set programming (OASP) is a knowledge representation paradigm that allows for a tight integration of logic programming rules and Description logic ontologies. Although several decidable fragments of OASP exist, no reasoning procedures for such expressive fragments were identified so far. We provide an algorithm that checks satisfiability in nexptime for the fragment of exptime-complete simple conceptual logic programs. © Copyright 2008 front matter by the editors.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Disjunctive logic programming and autoepistemic logic

Disjunctive logic programming and autoepistemic logic

引用

3rd international workshop on logic programming and knowledge representation

作者： Yuan, LY You, JH Goebel, R Univ Alberta Dept Comp Sci Edmonton AB T6G 2H1 Canada

ISBN: (纸本)3540649581

In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different types of negative introspection in autoepistemic reasoning present two different interpretations of default negation: consistency-based and minimal-model-based. We also observed that all logic program semantics fall into three semantical points of view: the skeptical, stable, and partial-stable. Based on these two observations, we classify disjunctive logic program semantics into six different categories, and discuss the relationships among various semantics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A system for abductive learning of logic programs

A system for abductive learning of logic programs

引用

3rd international workshop on logic programming and knowledge representation

作者： Lamma, E Mello, P Milano, M Riguzzi, F Univ Bologna DEIS I-40136 Bologna Italy Univ Ferrara Dipartimento Ingn I-44100 Ferrara Italy

ISBN: (纸本)3540649581

We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction problem has been defined as an extension of the Inductive logic programming framework. In the new problem definition, both the background and the target theories are abductive logic programs and abductive derivability is used as the coverage relation. LAP is based on the basic top-down ILP algorithm that has been suitably extended. In particular, coverage of examples is tested by using the abductive proof procedure defined by Kakas and Mancarella [24]. Assumptions can be made in order to cover positive examples and to avoid the coverage of negative ones. and these assumptions can be used as new training data. LAP can be applied for learning in the presence of incomplete knowledge and for learning exceptions to classification rules.

关键词： abduction learning

来源：评论

学校读者我要写书评

暂无评论

Abduction, argumentation and bi-disjunctive logic programs

Abduction, argumentation and bi-disjunctive logic programs

引用

3rd international workshop on logic programming and knowledge representation

作者： Wang, KW Chen, HW Changsha Inst Technol Sch Comp Changsha 410073 Peoples R China

ISBN: (纸本)3540649581

We study the relationship between argumentation (abduct ion) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for disjunctive logic programming is presented, in which the disjunctions of negative literals are taken as possible assumptions rather than only negative literals as the case of non-disjunctive logic programming. In our framework, three semantics PDH, CDH and WFDH are defined by three kinds of acceptable hypotheses to represent credulous reasoning, moderate reasoning and skeptical reasoning in AI, respectively. On the other hand, our semantic framework could be established in a broader class than that of disjunctive programs (called bi-disjunctive logic programs) and, hence, the corresponding abductive framework is abbreviated as BDAS (Bi-Disjunctive Argumentation-theoretic Semantics). Besides its rich expressive power and nondeterminism, BDAS integrates and naturally extends many key semantics, such as the minimal models, EGCWA, the well-founded model, and the stable models. In particular, a novel and interesting argumentation-theoretic characterization of EGCWA is shown. Thus the framework in this paper does not only provides a new way of performing argumentation (abduction) in disjunctive logic programming, but also is a simple, intuitive and unifying semantic framework for disjunctive logic programming.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Process representation using transaction logic

Process representation using transaction logic

引用

Joint 7th international Rule Challenge, the Special Track on Human Language Technology and the 3rd RuleML Doctoral Consortium Hosted at the 8th international Symposium on Rules, RuleML 2013

作者： Basseda, Reza Stony Brook University Stony Brook NY 11794 United States

Representing and answering the queries about the dynamic behavior of processes in knowledge base systems has become a challenging research area in the field of logic programming and knowledge representation systems. In this report, we are going to show how transaction logic can be used to efficiently represent dynamic behavior embedded in different domains. The ability of properly representing state changes in transaction logic enables us to express dynamic behavior of processes in different domains. The use of transaction logic to represent dynamic behavior decreases the size of knowledge bases and the query response time in comparison with other existing approaches. The efficiency of our method along with other features of transaction logic and its theoretical basis makes it an appropriate approach to represent dynamic behavior of processes in various domains.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Semantic Web reasoning with Conceptual logic Programs

引用

3rd international workshop on Rules and Rule Markup Languages for the Semantic Web

作者： Heymans, S Van Nieuwenborgh, D Vermeir, D Free Univ Brussels Dept Comp Sci B-1050 Brussels Belgium

ISBN: (纸本)3540238425

We extend Answer Set programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while carefully guarding useful knowledge representation mechanisms such as negation as failure and inequalities. Reasoning with the resulting Conceptual logic Programs can be reduced to finite, normal Answer Set programming, for which reasoners are available. We argue that Conceptual logic programming is a useful tool for uniformly representing and reasoning with both ontologies and rules on the Semantic Web, as they can capture a large fragment of the OWL DL ontology language, while extending it in various aspects.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：