Results 1  10
of
92
Answer Sets for Propositional Theories
 In Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR
, 2005
"... Abstract. 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 c ..."
Abstract

Cited by 68 (8 self)
 Add to MetaCart
Abstract. 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 logic programming, 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. 1
Probabilistic reasoning with answer sets
 In Proceedings of LPNMR7
, 2004
"... Abstract. We give a logic programming based account of probability and describe a declarative language Plog capable of reasoning which combines both logical and probabilistic arguments. Several nontrivial examples illustrate the use of Plog for knowledge representation. 1 ..."
Abstract

Cited by 63 (9 self)
 Add to MetaCart
Abstract. We give a logic programming based account of probability and describe a declarative language Plog capable of reasoning which combines both logical and probabilistic arguments. Several nontrivial examples illustrate the use of Plog for knowledge representation. 1
Strong Equivalence Made Easy: Nested Expressions and Weight Constraints
 THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2003
"... Logic programs P and Q are strongly equivalent if, given any program R, programs P + R and Q + R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without c ..."
Abstract

Cited by 62 (1 self)
 Add to MetaCart
Logic programs P and Q are strongly equivalent if, given any program R, programs P + R and Q + R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without considering the whole program. Lifschitz, Pearce and Valverde showed that Heyting's logic of hereandthere can be used to characterize strong equivalence for logic programs with nested expressions (which subsume the betterknown extended disjunctive programs). This note considers a simpler, more direct characterization of strong equivalence for such programs, and shows that it can also be applied without modication to the weight constraint programs of Niemel?a and Simons. Thus, this characterization of strong equivalence is convenient for the study of equivalent transformations of logic programs written in the input languages of answer set programming systems dlv and smodels. The note concludes with a brief discussion of results that can be used to automate reasoning about strong equivalence, including a novel encoding that reduces the problem of deciding the strong equivalence of a pair of weight constraint programs to that of deciding the inconsistency of a weight constraint program.
Loop Formulas for Disjunctive Logic Programs
 In Proc. ICLP03
, 2003
"... We extend Clark's de nition of a completed program and the de nition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion th ..."
Abstract

Cited by 47 (9 self)
 Add to MetaCart
We extend Clark's de nition of a completed program and the de nition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. The concept of a tight program and Fages' theorem are extended to disjunctive programs as well.
Answer set programming based on propositional satisfiability
 JOURNAL OF AUTOMATED REASONING
, 2006
"... Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic programs to SA ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional 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 SATbased procedure, called ASPSAT, 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 theoretical perspective, we prove soundness and completeness of ASPSAT. From a practical perspective, we have (i) implemented ASPSAT in Cmodels, (ii) extended the basic procedures in order to incorporate the most popular SAT reasoning strategies, and (iii) conducted an extensive comparative analysis involving also other stateoftheart answer set solvers. The experimental analysis shows that our solver is competitive with the other solvers we considered, and that the reasoning strategies that work best on “small but hard” problems are ineffective on “big but easy” problems and vice versa.
Satbased answer set programming
 In Proc. AAAI04
, 2004
"... 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. Various translations from ASP to SAT are known but the resulting SAT formula either ..."
Abstract

Cited by 32 (8 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. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical size. There are also well known results showing a onetoone correspondence between the answer sets of a logic program and the models of its completion. Unfortunately, these results only work for specific classes of problems. In this paper we present a SATbased decision procedure for answer set programming that (i) deals with any (non disjunctive) logic program, (ii) works on a SAT formula without additional variables, and (iii) is guaranteed to work in polynomial space. Further, our procedure can be extended to compute all the answer sets still working in polynomial space. The experimental results of a prototypical implementation show that the approach can pay off sometimes by orders of magnitude.
Definitions in Answer Set Programming
"... In answer set programming, combinatorial search problems are solved by writing logic programs the answer sets of which correspond to solutions. Such programs often contain auxiliary atoms, "defined" in terms of atoms introduced earlier. To prove that the answer sets of a program containing defin ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
In answer set programming, combinatorial search problems are solved by writing logic programs the answer sets of which correspond to solutions. Such programs often contain auxiliary atoms, "defined" in terms of atoms introduced earlier. To prove that the answer sets of a program containing definitions correspond to the solutions of the problem we want to solve, we need to understand how adding definitions aects the collection of answer sets. In particular, it is useful to be able to describe the effects of adding definitions to a program with nested expressions, in view of the relation of this class of programs to the input language of the answer set programming system smodels. In this paper we generalize the splitting set theorem to programs with nested expressions and show how this generalization can be used to prove program correctness in answer set programming. We also show that, under certain conditions, adding explicit and recursive definitions to a program with nested expressions extends its answer sets conservatively.
Semantical Characterizations and Complexity of Equivalences in Answer Set Programming
 ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
, 2007
"... In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R have the same answer sets for any other program R. This property strengthens the equivalence of P and Q with respect to answe ..."
Abstract

Cited by 28 (12 self)
 Add to MetaCart
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R have the same answer sets for any other program R. This property strengthens the equivalence of P and Q with respect to answer sets (which is the particular case for R =∅), and has its applications in program optimization, verification, and modular logic programming. In this article, we consider more liberal notions of strong equivalence, in which the actual form of R may be syntactically restricted. On the one hand, we consider uniform equivalence where R is a set of facts, rather than a set of rules. This notion, which is wellknown in the area of deductive databases, is particularly useful for assessing whether programs P and Q are equivalent as components of a logic program which is modularly structured. On the other hand, we consider relativized notions of equivalence where R ranges over rules over a fixed alphabet, and thus generalize our results to relativized notions of strong and uniform equivalence. For all these notions, we consider disjunctive logic programs in the propositional (ground) case as well as some restricted classes, providing semantical characterizations and analyzing the computational complexity. Our results, which naturally extend to answer set semantics for programs with strong negation, complement the results on strong
Strong Equivalence for Logic Programs and Default Theories (Made Easy)
 In Proc. LPNMR01, LNCS 2173
, 2001
"... Logic programs P and Q are strongly equivalent if, given any logic program R, programs P + R and Q + R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct wit ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
Logic programs P and Q are strongly equivalent if, given any logic program R, programs P + R and Q + R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without considering the whole program. Recently, Lifshitz, Pearce and Valverde showed that Heyting's logic of hereandthere can be used to characterize strong equivalence of logic programs. This paper introduces a more direct characterization, and extends it to default logic. In their paper, Lifschitz, Pearce and Valverde study a very general form of logic programs, called "nested" programs. For the study of strong equivalence of default theories, it is convenient to introduce a corresponding "nested" version of default logic, which generalizes Reiter's default logic.
Characterization of Strongly Equivalent Logic Programs in Intermediate Logics
 in Intermediate Logics. Theory and Practice of Logic Programming
, 2001
"... The nonclassical, nonmonotonic inference relation associated with the stable model semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be veri ed in the 3valued Godel logic, G3, the strongest nonclassical intermediate proposition ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
The nonclassical, nonmonotonic inference relation associated with the stable model semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be veri ed in the 3valued Godel logic, G3, the strongest nonclassical intermediate propositional logic (see [10]). In this paper we will show that KC (the logic of :p _ ::p), is the weakest intermediate logic for which strongly equivalent logic programs in a language allowing negations are logically equivalent.