logic programming, as exemplified by datalog, defines the meaning of a program as its unique smallest model: the deductive closure of its inference rules. However, many problems call for an enumeration of models that ...
详细信息
Traditionally, in the argumentation theory literature structured arguments are constructed from rules interpretations aiming to build well-supported deductive evidence. Different from other approaches, we emphasize th...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Traditionally, in the argumentation theory literature structured arguments are constructed from rules interpretations aiming to build well-supported deductive evidence. Different from other approaches, we emphasize the role of investigating general frameworks that can also provide a consistent and well-defined justification for a conclusion that cannot be inferred and there is certainty about it, which we call here NAF-arguments, which have been less explored in the formal argumentation theory, despite its potential use in practical applications for building nuanced well-structured explanations and justifications. This article introduces the so-called semantic argumentation guaranteeing well-known principles for quality in structured argumentation, and with the ability to generate two types of arguments, those where the conclusion atoms are semantically interpreted as true, and those where the conclusion is assumed to be false, we call them here semantic and NAF-arguments respectively. This framework is defined on the set of all logic programs in terms of rewriting systems based on a confluent set of transformation rules, the so-called Confluent logic programming Systems, making this approach a general framework. Additionally, we introduce a method for building such arguments using the program's strata through partial interpretations. We implement our framework named semantic argumentation solver available open source.
Thales aims to develop a virtual assistant to support pilots during flights, with a central component being the knowledge base. This knowledge base is built using a knowledge representation (KR) and reasoning system, ...
详细信息
ISBN:
(纸本)9783031789540;9783031789557
Thales aims to develop a virtual assistant to support pilots during flights, with a central component being the knowledge base. This knowledge base is built using a knowledge representation (KR) and reasoning system, encompassing various knowledge types including static and dynamic. However, existing KR systems present some limitations which include expressiveness and reasoning performance. The problem of expressiveness can be addressed by integrating two distinct KR concepts: Rules and Ontologies. Ontologies offers a framework for formalizing concepts, properties, and relationships, whereas rules express knowledge through IF-Then constructs. Integrating these approaches enriches knowledge representation and reasoning systems in many ways and helps to achieve completeness. However, this integration poses challenges, such as the difficulty of aligning their semantics and addressing issues of decidability. This thesis focuses on defining a methodology to combine rules and ontologies to overcome these challenges and build an optimized reasoner to execute the reasoning tasks of the virtual assistant ensuring good performance.
logic programming was one of the first formalisms to incorporate non-monotonic reasoning and, as such, is the origin of many semantics for this type of reasoning. Many of the core argumentation systems, including Abst...
详细信息
A new unification algorithm, called S-unification, is introduced as a special imcomplete case of E-unification for use in the problem of the reusability of existing traditional software in logic programs. Whenever S-...
详细信息
A new unification algorithm, called S-unification, is introduced as a special imcomplete case of E-unification for use in the problem of the reusability of existing traditional software in logic programs. Whenever S-unification succeeds, the result is a singleton complete set of E-unifiers of the arguments. S-unification also may fail, which means that the actual arguments have no E-unifiers, or it may report that it cannot solve the problem of E-unification for the given arguments. The analysis is based on the intention to reuse existing functional procedures in a logic programming system based on Horn clause logic with SLD resolution. The problem of amalgamation of external functional procedures in a logic program is analyzed, resulting in the characterization of a class of amalgamated programs for which S-unification is complete. The proposed approach gives a well-defined semantical basis for "evaluable predicates" in PROLOG.
The idea of lean deduction is to achieve maximal efficiency from minimal means. Every possible effort is made to eliminate overhead. logic programming languages provide an ideal tool for implementing lean deduction as...
详细信息
The idea of lean deduction is to achieve maximal efficiency from minimal means. Every possible effort is made to eliminate overhead. logic programming languages provide an ideal tool for implementing lean deduction as they offer a level of abstraction that is close to the needs for building first-order deduction systems. In this paper, we describe the principle of lean deduction and present leanT(A)P, an instance of it implemented in standard Prolog.
We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the proof-theoretic and model-theoretic issues and the relationships between them.
We survey here various approaches which were proposed to incorporate negation in logic programs. We concentrate on the proof-theoretic and model-theoretic issues and the relationships between them.
In this work an intelligent system pertaining to sheet metal part and process design has been developed, storing knowledge and prescribing ways to use this knowledge according to the "programming in logic" p...
详细信息
In this work an intelligent system pertaining to sheet metal part and process design has been developed, storing knowledge and prescribing ways to use this knowledge according to the "programming in logic" paradigm. The sheet metal parts covered by the software are those having U shape and being manufactured by bending (folding), cutting and piercing with particular emphasis on progressive dies. The use envisaged and corresponding parts of the system are: checking the part design for manufacturability, planning process phases, and checking the configuration of press tools involved. Particular attention is paid to the presentation of knowledge that has been gathered from handbooks and verified / enhanced in industry. This is first presented in natural language and then its formal representation in Prolog is described and explained by examples. Part design and press tool checking knowledge is relatively straightforward to represent and structure 'linearly'. Process planning knowledge is based on patterns that are captured in lists and activated in a case-by-case fashion exploiting the power of Prolog. Validation of the system was conducted using examples from industry.
暂无评论