Esra Erdem, Vladimir Lifschitz  Home/Search
Context Related
| utexas.edu/users/esra/paper...iclp01.ps toronto.edu/~esra/papers/iclp01.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utexas.edu/users/esra/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We extend a theorem by Francois Fages about the relationship between the completion semantics and the answer set semantics of logic programs to a class of programs with nested expressions permitted in the bodies of rules. Fages' theorem is important from the perspective of answer set programming: whenever the two semantics are equivalent, answer sets can be computed by propositional solvers, such as sato, instead of answer set solvers, such as smodels. The need to extend Fages' theorem... (Update)
Context of citations to this paper: More
...illustrated by proving the equivalence of two solutions to the 8 queens problem. Another use of this work is described in [Erdem and Lifschitz, 2001] . In that paper, a theorem from [Fages, 1994] about the relationship between the completion semantics and the answer set...
...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...
Cited by: More
Tight Logic Programs - Erdem, Lifschitz (Correct)
Weight Constraints as Nested Expressions - Ferraris, Lifschitz (2000) (Correct)
Active bibliography (related documents): More All
0.8: Fages' Theorem for Programs with Nested Expressions - Erdem, Lifschitz (2001) (Correct)
0.1: What is in a model? Epistemological ambiguity of Logic Programming - Denecker (Correct)
0.1: Loop Formulas for Disjunctive Logic Programs - Lee, Lifschitz (2003) (Correct)
Similar documents based on text: More All
0.5: Fages' Theorem and Answer Set Programming - Babovich, Erdem, Lifschitz (2000) (Correct)
0.5: Reconstructing the Evolutionary History of.. - Erdem, Lifschitz.. (Correct)
0.5: Strong Equivalence Made Easy: Nested Expressions and Weight.. - Turner (2003) (Correct)
Related documents from co-citation: More All
2: The Stable Model Semantics for Logic Programming - Gelfond - 1988
2: ACM Transactions on Computational Logic (context) - Lifschitz, Pearce et al. - 2001
BibTeX entry: (Update)
Esra Erdem and Vladimir Lifschitz. Fages' theorem for programs with nested expressions. In Proc. ICLP-01, 2001. To appear. http://citeseer.ist.psu.edu/erdem01fages.html More
@article{ erdem01fages,
author = "E. Erdem and V. Lifschitz",
title = "{Fages}' Theorem for Programs with Nested Expressions",
journal = "Lecture Notes in Computer Science",
volume = "2237",
pages = "242--??",
year = "2001",
url = "citeseer.ist.psu.edu/erdem01fages.html" }
Citations (may not include all citations):858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
759 Negation as failure (context) - Clark - 1978
435 Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988
214 Constraint Satisfaction in Logic Programming (context) - van Hentenryck - 1989
190 Using CSP look-back techniques to solve realworld SAT instan.. - Bayardo, Schrag - 1997
105 Making Prolog more expressive (context) - Lloyd, Topor - 1984
65 Answer set planning - Lifschitz - 1999
64 A deductive system for non-monotonic reasoning - Eiter, Leone et al. - 1997
54 SATO: An ecient propositional prover (context) - Zhang - 1997
29 Ecient implementation of the well-founded and stable model s.. (context) - Niemel, Patrik
19 Consistency of Clark's completion and existence of stable mo.. - cois - 1994
18 Fages' theorem and answer set programming - Babovich, Erdem et al.
15 Weight constraints as nested expressions - Ferraris, Lifschitz - 2001
14 Annals of Mathematics and Articial Intelligence (context) - Lifschitz, Tang et al. - 1999
6 Logic programming approaches for representing and solving co.. - Pelov, De Mot et al.
2 and Francesca Rossi (context) - Denecker, Van Nu et al.
Documents on the same site (http://www.cs.utexas.edu/users/esra/papers.html): More
A Re-Definition of Least Generalizations, and.. - Esra Erdem, Pierre.. (Correct)
An MSG-Method for Inductive Logic Program Synthesis - Erdem (1996) (Correct)
Wire Routing and Satisfiability Planning - Erdem, Lifschitz, Wong (2000) (Correct)
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