In this paper, we investigate the problem of contraction in Defeasible logicprogramming (DeLP), a logic-based approach for defeasible argumentation. We develop different notions of contraction based on both, the diff...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
In this paper, we investigate the problem of contraction in Defeasible logicprogramming (DeLP), a logic-based approach for defeasible argumentation. We develop different notions of contraction based on both, the different forms of entailment implicitly existent in argumentation-based formalisms and the influence literals exhibit in the reasoning process. We give translations of widely accepted rationality postulates for belief contraction to our framework. Moreover we discuss on the applicability of contraction for defeasible argumentation and the role of influence in this matter.
logicprogramming emerged in the 1970s from debates concerning procedural versus declarative representations of knowledge in artificial intelligence. In those days, declarative representations were associated mainly w...
详细信息
ISBN:
(纸本)9783642405648
logicprogramming emerged in the 1970s from debates concerning procedural versus declarative representations of knowledge in artificial intelligence. In those days, declarative representations were associated mainly with bottom-up proof procedures, such as hyper-resolution. the development of logicprogramming showed that procedural representations could be obtained by applying top-down proof procedures, such as linear resolution, to declarative representations in logical form. In recent years, logicprogramming has become more purely declarative, withthe development of answer set programming, tabling and the revival of data-log. these recent developments invite comparison with earlier attempts to reconcile procedural and declarative representations of knowledge, and raise the question whether anything has been lost.
this paper presents so-called asl-explanation graphs for answer set programming based on a translation of extended logic programs to abstract dialectical frameworks (ADF). the graphs show how a literal can be derived ...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
this paper presents so-called asl-explanation graphs for answer set programming based on a translation of extended logic programs to abstract dialectical frameworks (ADF). the graphs show how a literal can be derived from the program, and they evaluate in an argumentative way why necessary assumptions about literals not contained in an answer set hold. Withthe set of all asl-explanation graphs for a literal and an answer set, it is possible to explain and justify thoroughly why the literal is or is not contained in that answer set. Additionally, we provide a criterion to improve the clarity of explanations by pruning nodes without loss of information and selecting most significant asl-explanation graphs.
Przymusinski's Autoepistemic logic of Knowledge and Belief (AELKB) is a unifying framework for various non-monotonic formalisms. In this paper we present a semantic characterization of AELKB in terms of Dynamic Kr...
详细信息
ISBN:
(纸本)3540667490
Przymusinski's Autoepistemic logic of Knowledge and Belief (AELKB) is a unifying framework for various non-monotonic formalisms. In this paper we present a semantic characterization of AELKB in terms of Dynamic Kripke Structures (DKS). A DKS is composed of two components - a static one (a Kripke structure) and a dynamic one (a set of transformations). Transformations between possible worlds correspond to hypotheses generation and to revisions. therefore they enable to define a semantics of insertions to and revisions of AELKB-theories. A computation of the transformations (between possible worlds) is based on (an enhanced) model-checking. the transformations may be used as a method of computing static autoepistemic expansions.
this article presents cmMUS-a tool for deciding whether a clause belongs to some minimal unsatisfiable subset (MUS) of a given formula. While MUS-membership has a number of practical applications, related with underst...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
this article presents cmMUS-a tool for deciding whether a clause belongs to some minimal unsatisfiable subset (MUS) of a given formula. While MUS-membership has a number of practical applications, related with understanding the causes of unsatisfiability, it is computationally challenging-it is Sigma(P)(2)-complete. the presented tool cmMUS solves the problem by translating it to propositional circumscription, a well-known problem from the area of nonmonotonicreasoning. the tool constantly outperforms other approaches to the problem, which is demonstrated on a variety of benchmarks.
In this paper we introduce a multi-context variant of Reiter's default logic. the logic provides a syntactical counterpart of Roelofsen and Serafini's information chain approach (IJCAI-05), yet has several adv...
详细信息
In this paper we introduce a multi-context variant of Reiter's default logic. the logic provides a syntactical counterpart of Roelofsen and Serafini's information chain approach (IJCAI-05), yet has several advantages: it is closer to standard ways of representing nonmonotonic inference and a number of results from that area come "for free";it is closer to implementation, in particular the restriction to logicprogramming gives us a computationally attractive framework;and it allows us to handle a problem withthe information chain approach related to skeptical reasoning.
Although parity constraints are at the heart of many relevant reasoning modes like sampling or model counting, little attention has so far been paid to their integration into ASP systems. We address this shortcoming a...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
Although parity constraints are at the heart of many relevant reasoning modes like sampling or model counting, little attention has so far been paid to their integration into ASP systems. We address this shortcoming and investigate a variety of alternative approaches to implementing parity constraints, ranging from rather basic ASP encodings to more sophisticated theory propagators (featuring Gauss-Jordan elimination). All of them are implemented in the xorro system by building on the theory reasoning capabilities of the ASP system dingo. Our comparative empirical study investigates the impact of the number and size of parity constraints on performance and indicates the merits of the respective implementation techniques. Finally, we benefit from parity constraints to equip xorro with means to sample answer sets, paving the way for new applications of ASP.
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different methods of approximation and obtain results...
详细信息
ISBN:
(纸本)3540285385
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different methods of approximation and obtain results on the relationship between them. Since general logic programs with single literals as heads are equivalent to revision programs, we obtain results on approximations of justified revisions of databases by revision programs.
Two sets of rules are said to be strongly equivalent to each other if replacing one by the other within any logic program preserves the program's stable models. the familiar characterization of strong equivalence ...
详细信息
ISBN:
(纸本)9783540721994
Two sets of rules are said to be strongly equivalent to each other if replacing one by the other within any logic program preserves the program's stable models. the familiar characterization of strong equivalence of grounded programs in terms of the propositional logic of here-and-there is extended in this paper to a large class of logic programs with variables. this class includes, in particular, programs with conditional literals and cardinality constraints. the first-order version of the logic of here-and-there required for this purpose involves two additional non-intuitionistic axiom schemas.
We extend the language of here-and-there logic by two kinds of atomic programs allowing to minimally update the truth value of a propositional variable here or there, if possible. these atomic programs are combined by...
详细信息
ISBN:
(纸本)9783642405648
We extend the language of here-and-there logic by two kinds of atomic programs allowing to minimally update the truth value of a propositional variable here or there, if possible. these atomic programs are combined by the usual dynamic logic program connectives. We investigate the mathematical properties of the resulting extension of equilibrium logic: we prove that the problem of logical consequence in equilibrium models is EXPTIME complete by relating equilibrium logic to dynamic logic of propositional assignments.
暂无评论