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.
This paper introduces a novel simulation modeling framework that seamlessly integrates Petri nets with logic programming, resulting in intelligent and adaptable simulation models capable of handling both discrete and ...
详细信息
This paper introduces a novel simulation modeling framework that seamlessly integrates Petri nets with logic programming, resulting in intelligent and adaptable simulation models capable of handling both discrete and continuous events. Instead of treating systems as standalone Petri nets, this methodology embeds Petri net semantics within simulation models, creating a hybrid state vector that incorporates attributes from both the Petri net and model-specific states. In addition, the modular design of the model supports high reusability and scalability, making it applicable across various domains, including industrial automation and workflow management. Embedding Petri nets within simulation entities enhances dynamic decision-making and specialized time-management capabilities. This approach reduces errors associated with fixed time-step sizes, thereby improving the accuracy of continuous event simulations. The solution introduces the external transition concept for Petri nets and implements a time-management approach based on qualitative landmarks and mathematically meaningful points, effectively minimizing errors caused by simulation time-step variations. To demonstrate the framework's versatility and effectiveness, six example applications illustrate how combining Petri nets with logic programming enhances the analytical power and flexibility of traditional simulation models. Ultimately, this paper establishes a comprehensive hybrid simulation framework that unifies discrete and continuous analysis, endows simulation entities with reasoning capabilities through logic programming, and provides robust modularity.
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.
暂无评论