this paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. the basic function of the system is to check if two given ground disjunctive logic programs are equivalent, an...
详细信息
ISBN:
(纸本)3540285385
this paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. the basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. We have used the system to discover some interesting theorems about strong equivalence [Lin and Chen, 2005]. Here we briefly describe how the system can be used to find out whether a given set of rules is strongly equivalent to another, perhaps simpler set of rules.
the paper presents DLV(+)a Disjunctive logicprogramming system with object-oriented constructs, including classes, objects, (multiple) inheritance, and types. DLV+ is built on top of DLV (a state-of-the art DLP syste...
详细信息
ISBN:
(纸本)3540285385
the paper presents DLV(+)a Disjunctive logicprogramming system with object-oriented constructs, including classes, objects, (multiple) inheritance, and types. DLV+ is built on top of DLV (a state-of-the art DLP system), and provides a graphical user interface that allows to specify, update, browse, query, and reason on knowledge bases. Two strong points of the system are the powerful type-checking mechanism, and the advanced interface for visual querying.
In this paper we generalize the notion of approximation of action theories introduced in [ 13,26]. We introduce a logicprogramming based method for constructing approximation of action theories of AL and prove its so...
详细信息
ISBN:
(纸本)3540285385
In this paper we generalize the notion of approximation of action theories introduced in [ 13,26]. We introduce a logicprogramming based method for constructing approximation of action theories of AL and prove its soundness. We describe an approximation based conformant planner and compare its performance with other state-of-the-art conformant planners.
the rapid expansion of the Internet and World Wide Web led to growing interest in data and information integration, which should be capable to deal with inconsistent and incomplete data. Answer Set solvers have been c...
详细信息
ISBN:
(纸本)3540285385
the rapid expansion of the Internet and World Wide Web led to growing interest in data and information integration, which should be capable to deal with inconsistent and incomplete data. Answer Set solvers have been considered as a tool for data integration systems by different authors. We discuss why data integration can be an interesting model application of Answer Set programming, reviewing valuable features of non-monotonic logic programs in this respect, and emphasizing the role of the application for driving research.
Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarely explored. In this paper we first introduce th...
详细信息
ISBN:
(纸本)3540285385
Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarely explored. In this paper we first introduce the epistemic HT-logic, and then propose a more general extension of logic programs called nested epistemic logic programs. the semantics of this extension - named equilibrium views - is defined on the basis of the epistemic HT-logic. We prove that equilibrium view semantics extends boththe answer sets of nested logic programs and the world views of epistemic logic programs. therefore, our work establishes a unifying framework for both nested logic programs and epistemic logic programs. Furthermore, we also provide a characterization of the strong equivalence of two nested epistemic logic programs.
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. logic programs correspond to the special case in which every formula is a "ru...
详细信息
ISBN:
(纸本)3540285385
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. logic programs correspond to the special case in which every formula is a "rule" - an implication that has no implications in the antecedent (body) and consequent (head). the semantics of equilibrium logic looks very different from the usual definitions of an answer set in logicprogramming, as it is based on Kripke models. In this paper we propose a new definition of equilibrium logic which uses the concept of a reduct, as in the standard definition of an answer set. Second, we apply the generalized concept of an answer set to the problem of defining the semantics of aggregates in answer set programming. We propose, in particular, a semantics for weight constraints that covers the problematic case of negative weights. Our semantics of aggregates is an extension of the approach due to Faber, Leone, and Pfeifer to a language with choice rules and, more generally, arbitrary rules with nested expressions.
We present the action language GC+ for reasoning about actions in multi-agent systems under probabilistic uncertainty and partial observability, which is an extension of the action language C+ that is inspired by part...
详细信息
ISBN:
(纸本)3540285385
We present the action language GC+ for reasoning about actions in multi-agent systems under probabilistic uncertainty and partial observability, which is an extension of the action language C+ that is inspired by partially observable stochastic games (POSGs). We provide a finite-horizon value iteration for this framework and show that it characterizes finite-horizon Nash equilibria. We also describe how the framework can be implemented on top of nonmonotonic causal theories. We then present acyclic action descriptions in GC+ as a special case where transitions are computable in polynomial time. We also give an example that shows the usefulness of our approach in practice.
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.
We describe Modular-E (ME), a specialized, modeltheoretic logic for narrative reasoning about actions, able to represent non-deterministic domains involving concurrency, static laws (constraints) and indirect effects ...
详细信息
ISBN:
(纸本)3540285385
We describe Modular-E (ME), a specialized, modeltheoretic logic for narrative reasoning about actions, able to represent non-deterministic domains involving concurrency, static laws (constraints) and indirect effects (ramifications). We give formal results which characterize ME's high degree of modularity and elaboration tolerance, and show how these properties help to separate out, and provide a principled solutions to, the endogenous and exogenous qualification problems. We also show how a notion of (micro) processes can be used to facilitate reasoning at the dual levels of temporal granularity necessary for narrative-based domains involving "instantaneous" series of indirect and knock-on effects.
暂无评论