We elaborate upon a recently proposed approach to finding an answer set of a logic program based on concepts from constraint processing and satisfiability checking. We extend this approach and propose a new algorithm ...
详细信息
ISBN:
(纸本)9783540721994
We elaborate upon a recently proposed approach to finding an answer set of a logic program based on concepts from constraint processing and satisfiability checking. We extend this approach and propose a new algorithm for enumerating answer sets. the algorithm, which to our knowledge is novel even in the context of satisfiability checking, is implemented in the clasp answer set solver. We contrast our new approach to alternative systems and different options of clasp, and provide an empirical evaluation.
In this paper, We propose a general default logic. It extends Reiter's default logic by adding rule connectives like disjunction in logicprogramming, and Ferraris's general logic program by allowing arbitrary...
详细信息
ISBN:
(纸本)9783540721994
In this paper, We propose a general default logic. It extends Reiter's default logic by adding rule connectives like disjunction in logicprogramming, and Ferraris's general logic program by allowing arbitrary propositional formulas to be the base in forming logic programs. We show the usefulness of this logic by applying it to formalizing rule constraints, generalized closed world assumptions, and conditional defaults.
We summarize the salient features of the current version of the answer set solver clasp, focusing oil the progress made since version RC4 of clasp. Apart from enhanced preprocessing and search-supporting techniques, a...
详细信息
ISBN:
(纸本)9783642042379
We summarize the salient features of the current version of the answer set solver clasp, focusing oil the progress made since version RC4 of clasp. Apart from enhanced preprocessing and search-supporting techniques, a particular emphasis lies on advanced reasoning modes, Such as cautious and brave reasoning, optimization, solution projection, and incremental solving.
Assumption-based argumentation is one of the most prominent formalisms for logical (or structured) argumentation. It has been shown useful for representing defeasible reasoning and has tight links to logicprogramming...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
Assumption-based argumentation is one of the most prominent formalisms for logical (or structured) argumentation. It has been shown useful for representing defeasible reasoning and has tight links to logicprogramming In this paper we study the Dung semantics for extended forms of assumption-based argumentation frameworks (ABFs), based on any contrapositive propositional logic, and whose defeasible rules are expressed by arbitrary formulas in that logic. In particular, new results on the well-founded semantics for such ABFs are reported, the redundancy of the closure condition is shown, and the use of disjunctive attacks is investigated. Finally, some useful properties of the generalized frameworks are considered.
We show how a class of domains written in the Language E, a high level language for reasoning about actions, narratives and. change, can be translated into the argumentation framework of logicprogramming without Nega...
详细信息
ISBN:
(纸本)3540667490
We show how a class of domains written in the Language E, a high level language for reasoning about actions, narratives and. change, can be translated into the argumentation framework of logicprogramming without Negation as Failure (LPwNF). this translation enables us 1) to understand default persistence as captured by various temporal reasoning frameworks in a simple and natural way, by assigning higher priority to information about effects of later actions over effects of earlier actions;2) to develop an argumentation-based computational model for this type of reasoning in logicprogramming goal-driven style.
Belief logicprogramming (BLP) is a novel form of quantitative logicprogramming in the presence of uncertain and inconsistent, information, which was designed to be able to combine and correlate evidence obtained fro...
详细信息
ISBN:
(纸本)9783642042379
Belief logicprogramming (BLP) is a novel form of quantitative logicprogramming in the presence of uncertain and inconsistent, information, which was designed to be able to combine and correlate evidence obtained from non-independent information sources. BLP has non-monotonic semantics based on the concepts of belief combination functions and is inspired by Dempster-Shafer theory of evidence. Most importantly, unlike the previous efforts to integrate uncertainty and logicprogramming, BLP can correlate structural information contained in rules and provides more accurate certainty estimates. the results are illustrated via simple, yet, realistic examples of rule-based Web service integration.
Within everyday reasoning we often use argumentation patterns that employ the rather vague notion of something being normally true. this form of reasoning is usually captured using Reiter's Default logic. However,...
详细信息
ISBN:
(纸本)9783642405648
Within everyday reasoning we often use argumentation patterns that employ the rather vague notion of something being normally true. this form of reasoning is usually captured using Reiter's Default logic. However, in Default logic one has to make explicit the rules which are to be used for reasoning and which are supposed to be normally true. this is a bit contrary to the everyday situation where people use experience to decide what normally follows from particular observations and what not, not using any kind of logical rules at all. To formalize this kind of reasoning we propose an approach which is based on prior experiences, using the fact that something follows normally if this is the case for "almost all" of the available experience.
this paper describes an exercise in the formalization of commonsense with Answer Set programming aimed at finding the answer to an interesting riddle, whose solution is not obvious to many people. Solving the riddle r...
详细信息
ISBN:
(纸本)9783642042379
this paper describes an exercise in the formalization of commonsense with Answer Set programming aimed at finding the answer to an interesting riddle, whose solution is not obvious to many people. Solving the riddle requires a considerable amount of commonsense knowledge and sophisticated knowledge representation and reasoning techniques, including planning and adversarial reasoning. Most importantly, the riddle is difficult enough to make it unclear, at first analysis, whether and how Answer Set programming or other formalisms can be used to solve it.
We define a nonmonotonic formalism that shares some features withthree other systems of nonmonotonicreasoning-default logic, logicprogramming with strong negation, and nonmonotonic causal logic-and study its possib...
详细信息
Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible logicprogramming approach with an underlyin...
详细信息
ISBN:
(纸本)9783540721994
Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible logicprogramming approach with an underlying argumentation based semantics, could be applied in a robotic domain for knowledge representation and reasoning about which task to perform next. At this end, we have selected a simple application domain, consisting of a micro-world environment using real and simulated robots for cleaning tasks.
暂无评论