Esra Erdem, Vladimir Lifschitz  Home/Search
Context
Related
| utexas.edu/users/vl/papers/tight.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/vl/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This note is about the relationship between two theories of negation as failure|one based on program completion, the other based on stable models, or answer sets. Francois Fages showed that if a logic program satis es a certain syntactic condition, which is now called "tightness," then its stable models can be characterized as the models of its completion. (Update)
Similar documents (at the sentence level):
72.2%: Tight Logic Programs - Erdem, Lifschitz (Correct)
20.2%: Transitive Closure, Answer Sets and Predicate Completion - Erdem, Lifschitz (Correct)
11.6%: Fages' Theorem for Programs with Nested Expressions - Erdem, Lifschitz (2001) (Correct)
Active bibliography (related documents): More All
0.5: Weight Constraints as Nested Expressions - Ferraris, Lifschitz (2000) (Correct)
0.5: Interactive Access Control for Web Services - Koshutanski, Massacci (2004) (Correct)
0.3: 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.4: Transformations of Logic Programs Related to Causality and.. - Erdem, Lifschitz (1999) (Correct)
0.3: Wire Routing and Satisfiability Planning - Erdem, Lifschitz, Wong (2000) (Correct)
BibTeX entry: (Update)
@misc{ erdem-tight,
author = "Esra Erdem and Vladimir Lifschitz",
title = "Tight Logic Programs",
url = "citeseer.ist.psu.edu/608438.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
374 Classical negation in logic programs and disjunctive databas.. - Gelfond, Lifschitz - 1991
149 Logic programming and knowledge representation - Baral, Gelfond - 1994
105 Making Prolog more expressive (context) - Lloyd, Topor - 1984
91 Splitting a logic program - Lifschitz, Turner - 1994
65 Answer set planning - Lifschitz - 1999
38 Foundations of logic programming - Lifschitz - 1996
27 Negation as failure in the head - Inoue, Sakama - 1998
26 ACM Transactions on Computational Logic (context) - Lifschitz, Pearce et al. - 2001
19 Consistency of Clark's completion and existence of stable mo.. - cois - 1994
18 Fages' theorem and answer set programming - Babovich, Erdem et al. - 2000
15 Weight constraints as nested expressions - Ferraris, Lifschitz - 2001
14 Annals of Mathematics and Arti cial Intelligence (context) - Lifschitz, Tang et al. - 1999
8 Transformations of logic programs related to causality and p.. - Erdem, Lifschitz - 1999
4 Causal laws and multi-valued uents (context) - Giunchiglia, Lee et al. - 2001
2 Fages' theorem for programs with nested expressions - Erdem, Lifschitz - 2001
2 Stable model semantics for weight constraint rules - Niemel, Patrik et al. - 1999
Documents on the same site (http://www.cs.utexas.edu/users/vl/papers.html): More
Representing Action: Indeterminacy and Ramifications - Giunchiglia (1997) (Correct)
Classical Negation in Logic Programs and Disjunctive Databases - Gelfond, Lifschitz (1991) (Correct)
Actions with Indirect Effects - Kartha, Lifschitz (1994) (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