We prove two properties of logic programs under the answer set semantics that may be useful in connection with applications of logicprogramming to representing causality and to planning. One theorem is about the use ...
详细信息
ISBN:
(纸本)3540667490
We prove two properties of logic programs under the answer set semantics that may be useful in connection with applications of logicprogramming to representing causality and to planning. One theorem is about the use of disjunctive rules to express that an atom is exogenous. the other provides an alternative way of expressing that a plan does not include concurrently executed actions.
this paper gives a summary of the First Answer Set programming System Competition that was held in conjunction withthe Ninthinternationalconference on logicprogramming and nonmonotonicreasoning. the aims of the c...
详细信息
ISBN:
(纸本)9783540721994
this paper gives a summary of the First Answer Set programming System Competition that was held in conjunction withthe Ninthinternationalconference on logicprogramming and nonmonotonicreasoning. the aims of the competition were twofold: first, to collect challenging benchmark problems, and second, to provide a platform to assess a broad variety of Answer Set programming systems. the competition was inspired by similar events in neighboring fields, where regular benchmarking has been a major factor behind improvements in the developed systems and their ability to address practical applications.
Turner's logic of universal causation is a general logic for nonmonotonicreasoning. It has its origin in McCain and Turner's causal action theories which have been translated to propositional logic and logic ...
详细信息
ISBN:
(纸本)9783642405648
Turner's logic of universal causation is a general logic for nonmonotonicreasoning. It has its origin in McCain and Turner's causal action theories which have been translated to propositional logic and logicprogramming with nested expressions. In this paper, we propose to do the same for Turner's logic, and show thatTurner's logic can actually be mapped to McCain and Turner's causal theories. these results can be used to construct a system for reasoning in Turner's logic.
Despite the obvious relevance of plausible reasoning to real-world problem solving, nonmonotoniclogics are rarely used in commercial applications or large- scale commonsense reasoning systems. this is largely because...
ISBN:
(纸本)3540667490
Despite the obvious relevance of plausible reasoning to real-world problem solving, nonmonotoniclogics are rarely used in commercial applications or large- scale commonsense reasoning systems. this is largely because few efficient algorithms and tools have thus far been developed.
At the occasion of the third internationalconference on Principles of Knowledge Representation and reasoning [1] in 1992, Ray Reiter delivered an invited talk entitled "Twelve Years of nonmonotonicreasoning Res...
详细信息
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.
Recently there has been increased interest in logicprogramming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and ...
详细信息
ISBN:
(纸本)3540667490
Recently there has been increased interest in logicprogramming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.
Aggregates in answer set programming (ASP) have recently been studied quite intensively. the main focus of previous work has been on defining suitable semantics for programs with arbitrary, potentially recursive aggre...
详细信息
ISBN:
(纸本)3540285385
Aggregates in answer set programming (ASP) have recently been studied quite intensively. the main focus of previous work has been on defining suitable semantics for programs with arbitrary, potentially recursive aggregates. By now, these efforts appear to have converged. On another line of research, the relation between unfounded sets and (aggregate-free) answer sets has lately been rediscovered. It turned out that most of the currently available answer set solvers rely on this or closely related results (e.g., loop formulas). In this paper, we unite these lines and give a new definition of unfounded sets for disjunctive logic programs with arbitrary, possibly recursive aggregates. While being syntactically somewhat different, we can show that this definition properly generalizes all main notions of unfounded sets that have previously been defined for fragments of the language. We demonstrate that, as for restricted languages, answer sets can be crisply characterized by unfounded sets: they are precisely the unfounded-free models. this result can be seen as a confirmation of the robustness of the definition of answer sets for arbitrary aggregates. We also provide a comprehensive complexity analysis for unfounded sets, and study its impact on answer set computation.
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate ...
详细信息
ISBN:
(纸本)354020721X
We give a logicprogramming based account of probability and describe a declarative language P-log capable of reasoning which combines bothlogical and probabilistic arguments. Several non-trivial examples illustrate the use of P-log for knowledge representation.
暂无评论