Propositional semantics for disjunctive logic programs

To address this problem, we propose an approach that adds loop formulas a few at a time, selectively. We test the system on a variety of benchmarks including the graph coloring, the blocks world planning, and Hamiltonian Circuit domains. Our experimental results show that in these domains, for the task of generating one answer set of a normal logic program, our system has a clear edge over the state-of-art answer set programming systems Smodels and DLV.

Citation Context Answer Set Programming ASP emerged in the late s as a new logic programming paradigm which has been successfully applied in various appli-cation domains. Also motivated by the availability of efficient solvers for propo-sitional satisfiability SAT , various reductions from logic pro Also motivated by the availability of efficient solvers for propo-sitional satisfiability SAT , various reductions from logic programs to SAT were introduced in the past.

All these reductions either are limited to a subclass of logic programs, or introduce new variables, or may produce exponentially bigger propositional formulas. In this paper, we present a SAT-based procedure, called ASP-SAT, that i deals with any non disjunctive logic program, ii works on a propositional formula without additional variables except for those possibly introduced by the clause form transformation , and iii is guaranteed to work in polynomial space. From a practical perspective, we have i implemented ASP-SAT in Cmodels, ii ex-tended the basic procedures in order to incorporate the most popular SAT reasoning strategies, and iii conducted an extensive comparative analysis involving also other state-of-the-art answer set solvers.

Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages, however, the modular structure of programs is hard to realise, since the output of an entire program cannot in general Abstract - Cited by 43 11 self - Add to MetaCart Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages, however, the modular structure of programs is hard to realise, since the output of an entire program cannot in general be composed from the output of its component programs in a direct manner.

In this paper, we consider these aspects for the stable-model semantics of disjunctive logic programs DLPs. The module theorem extends the well-known splitting-set theorem and allows also a generalisation of a shifting technique for splitting shared disjunctive rules among components.

AAAI , The relation between answer set programming ASP and propositional satisfiability SAT is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Abstract - Cited by 43 10 self - Add to MetaCart The relation between answer set programming ASP and propositional satisfiability SAT is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years.

There are also well known results showing a one-to-one correspondence between the answer sets of a logic program and the models of its completion. Partial Deduction in Disjunctive Logic Programming. View 2 excerpts, references background. Propositional semantics for disjunctive logic programs. Mathematics, Computer Science. Annals of Mathematics and Artificial Intelligence. View 1 excerpt, references background.

Ordered completion for first-order logic programs on finite structures. Unfolding partiality and disjunctions in stable model semantics. View 3 excerpts, references background. Enter the password to open this PDF file:. Cancel OK. File name: -. File size: -. Title: -. Author: -. Subject: -. Keywords: -.

Creation Date: -. Modification Date: -.