V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Equivalence in Answer Set Programming - Osorio, Navarro, Arrazola (2001) (3 citations) (Correct)
....of Logic Programming in the last 12 years. The main syntactic restriction needed in this paradigm is to eliminate function symbols from the language. One important issue is to know when two programs are equivalent with respect to ASP. We consider a de nition for equivalence that is given in [6]. We say that P 1 and P 2 are strongly equivalent i for every program P , P 1 [ P and P 2 [ P have the same answer sets. If two programs are strongly equivalent we know that we can replace one by the other in any larger program without changing the declarative semantics. This is an important ....
....replace one by the other in any larger program without changing the declarative semantics. This is an important concept for software engineering. It is known that Jankov logic as well as the logic of here and there (HT) characterize the class of strongly equivalent augmented programs under STABLE [6, 3]. Since there is much research and available software on classical logic and intuitionistic logic, we present some results of strongly equivalence with respect to these logics. Augmented logic programs allow nested expressions permitted in the bodies and heads of rules. These expressions are ....
[Article contains additional citation context not shown here]
Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, to appear.
Strong Equivalence Made Easy: Nested Expressions and Weight.. - Turner (2003) (11 citations) (Correct)
....study of equivalent transformations of logic programs written in the input languages of answer set programming systems dlv and smodels. 1 Introduction Logic programs P and Q are strongly equivalent if, given any program R, P [ R and Q [ R are equivalent. Recent work by Lifschitz, Pearce and Valverde [ 2001 ] used Heyting s logic of here and there to characterize strong equivalence of logic programs under the answer set semantics [ Gelfond and Lifschitz, 1991, Lifschitz et al. 1999 ] In a subsequent paper [ Turner, 2001 ] the current author characterized strong equivalence of logic programs ....
....R, P [ R and Q [ R are equivalent. Recent work by Lifschitz, Pearce and Valverde [ 2001 ] used Heyting s logic of here and there to characterize strong equivalence of logic programs under the answer set semantics [ Gelfond and Lifschitz, 1991, Lifschitz et al. 1999 ] In a subsequent paper [ Turner, 2001 ] the current author characterized strong equivalence of logic programs more directly, in terms of concepts used in the de nition of answer sets. In this alternative approach, no knowledge of the logic of here and there was required. Moreover, the more direct characterization of strong ....
[Article contains additional citation context not shown here]
Vladimir Lifschitz, David Pearce, and Agust in Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2001. To appear. Available at www.cs.utexas.edu/users/vl/papers.html.
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) Self-citation (Logic) (Correct)
No context found.
Vladimir Lifschitz, David Pearce, and Augustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001.
LPEQ and DLPEQ - Translators for Automated Equivalence.. - Janhunen, Oikarinen (2004) (1 citation) Self-citation (Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526541, 2001.
Verifying the Equivalence of Logic Programs in the.. - Oikarinen, Janhunen (2004) Self-citation (Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526541, 2001.
Testing the Equivalence of Logic Programs under Stable.. - Janhunen, Oikarinen (2002) (1 citation) Self-citation (Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526541, 2001.
Testing the Equivalence of Logic Programs under Stable.. - Janhunen, Oikarinen (2002) (1 citation) Self-citation (Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526541, 2001.
Eliminating Disjunction from Propositional Logic.. - Eiter, Fink, Tompits, .. (2003) Self-citation (Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001.
Simplifying Logic Programs under Uniform and Strong.. - Eiter, Fink, Tompits, al. (2004) Self-citation (Lifschitz Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001.
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) Self-citation (Logic) (Correct)
No context found.
Vladimir Lifschitz, David Pearce, and Augustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001.
A Polynomial Translation of Logic Programs with.. - Pearce, Sarsakov, .. (2002) (6 citations) Self-citation (Pearce Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001.
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) Self-citation (Logic) (Correct)
No context found.
Vladimir Lifschitz, David Pearce, and Augustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001.
Translatability And Intranslatability Results For Certain.. - Janhunen (2003) Self-citation (Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526--541, 2001.
Alternative Characterizations for Strong Equivalence of Logic.. - Cabalar Self-citation (Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2000. (to appear).
Vol. 7(2002): Nr 7 - Linkoping Sweden Http Self-citation (Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526--541, 2001.
Hypersequent Calculi for Gödel Logics - a Survey - Baaz, Ciabattoni, Fermüller Self-citation (Logic) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transaction on Computational Logic, 2(4):526--541, 2001.
Loop Formulas for Disjunctive Logic Programs - Lee, Lifschitz (2003) (4 citations) Self-citation (Lifschitz Logic) (Correct)
.... set of rules F G The syntax of a program de ned in [Lifschitz et al. 1999] is more general than the syntax de ned here in that a program can be in nite and can contain classical negation ( Classical negation can be easily eliminated by introducing auxiliary atoms as explained in [Lifschitz et al. 2001, Section 5] for all rules F G in . Finally, a set X of atoms is an answer set for a program if X is minimal among the sets of atoms that satisfy the reduct [ Lifschitz et al. 1999 ] A program 1 is strongly equivalent to a program 2 if, for every logic program , 1 [ ....
.... . Finally, a set X of atoms is an answer set for a program if X is minimal among the sets of atoms that satisfy the reduct [ Lifschitz et al. 1999 ] A program 1 is strongly equivalent to a program 2 if, for every logic program , 1 [ has the same answer sets as 2 [ Lifschitz et al. 2001 ] Section 4 of [ Lifschitz et al. 1999 ] contains a number of examples of strongly equivalent programs. The equivalence relation de ned in that paper is even stronger than strong equivalence. We understand the term clause to mean a disjunction of distinct atoms a 1 ; an (n 0) ....
Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
Tight Logic Programs - Erdem, Lifschitz Self-citation (Lifschitz Logic) (Correct)
....the answer set semantics to the completion semantics. This program has two answer sets ; fpg; they are identical to the models of the completion p : p (p q) q (2) of this program. A preliminary report on the tightness of programs with nested expressions is published in [ Erdem and Lifschitz, 2001 ] The second question studied here is the tightness of logic programs containing the de nition of the transitive closure of a predicate: 3) Such rules are found in many useful programs. Unfortunately, the de nition of tightness may be dicult to verify directly for a program containing ....
.... becomes unnecessary [ Babovich et al. 2000 ] Our generalization of Fages theorem allows us to apply this method to smodels programs containing the f g construct [ Niemel a et al. 1999 ] because such programs can be viewed as a special case of programs with nested expressions [ Ferraris and Lifschitz, 2001 ] For instance, the rst of rules (1) can be written in the syntax of smodels as fpg. Third, program completion is closely related to the semantics of causal theories [ Giunchiglia et al. 2001 ] and to the input language of the Causal Calculator . Fages theorem and its generalizations ....
[Article contains additional citation context not shown here]
Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
Polynomial Translations of Nested Logic Programs into.. - Pearce, Sarsakov, al. (2002) Self-citation (Pearce Logic) (Correct)
....program part 0 and leave the remaining part n 0 unchanged. For instance, if 0 is already a disjunctive logic program, we do not need to translate it again into another (equivalent) disjunctive logic program. Strong faithfulness is closely related to the concept of strong equivalence [22] (see below) Let us illustrate the practical relevance of this property by considering the well known graph problem of computing Hamiltonian paths: Given a directed graph (V; E) and a vertex a of this graph, determine INFSYS RR 1843 02 15 whether there exists a path in (V; E) starting at a and ....
.... (q )g: Obviously, fpg is the unique minimal model of . So, I is indeed an answer set for . In fact, there are no other answer sets. The following concepts are central: Two logic programs, 1 and 2 , are equivalent iff they possess the same answer sets. Following Lifschitz et al. [22], we call 1 and 2 strongly equivalent iff, for every program , 1 [ and 2 [ are equivalent. We introduce more general equivalence notions in Section 4. 2.2 Equilibrium Logic Equilibrium logic is an approach to nonmonotonic reasoning that generalises the answer set semantics for logic ....
[Article contains additional citation context not shown here]
V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001. INFSYS RR 1843-02-15
Weight Constraints as Nested Expressions - Ferraris, Lifschitz (2000) (10 citations) Self-citation (Lifschitz) (Correct)
....strongly equivalent to a program 2 if, for every program , 1 [ has the same answer sets as 2 [ For instance, rule (2) is strongly equivalent to rule (1) so that replacing one of these rules by the other in any program does not affect that program s answer sets. 2 The main theorem of [Lifschitz et al. 2001] shows that the strong equivalence of programs with nested expressions is characterized by the truth tables of the three valued logic known as the logic of here and there. It may appear that the two extensions of the basic syntax of logic programs nested expressions and weight constraints ....
....as shorthand for nested expressions of some special kind. We define a conceptually simple, modular translation that maps programs with weight constraints to programs with nested expressions and preserves the program s answer sets. This translation can be used, in combination with the result of [Lifschitz et al. 2001] , to prove the strong equivalence of programs with weight constraints. For instance, the fact that rule (3) is strongly equivalent to 0 fa; bg 2 a; b (4) can be proved by transforming (3) and (4) into programs with nested expressions, as follows. Our translation turns (3) into (a; not ....
[Article contains additional citation context not shown here]
Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2001. To appear.
Strong Equivalence for Logic Programs and Default Theories (Made.. - Turner (2001) (7 citations) Self-citation (Programs) (Correct)
No context found.
Vladimir Lifschitz, David Pearce, and Agust in Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, To appear, 2001.
Guarded Open Answer Set Programming - Stijn Heymans Davy (2005) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001.
On the Equivalence of Logic Programs - Oikarinen (2002) (Correct)
No context found.
Lifschitz V., Pearce P., Valverde A. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic, 2, pp. 526541. 2001.
A Logical Encoding of Well-Founded Semantics with Explicit Negation - Cabalar (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2000.
Strong Equivalence for Causal Theories - Turner (2004) (Correct)
No context found.
Vladimir Lifschitz, David Pearce, and Agust in Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.
On Eliminating Disjunctions in Stable Logic Programming - Eiter (2003) (Correct)
No context found.
V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4):526--541, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC