Jennifer Seitzer, John Schlipf  Home/Search
Context
Related
Links: ACM DBLP | msj.edu/seitzer/afford.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: msj.edu/seitzer/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Limiting the number of times a variable appears in either the head or the body of a rule, we identify two classes of normal propositional logic programs. These classes have the desirable property that stable models, if they exist, can be found in linear time (worst case). We also identify a related class containing programs for which the well-founded model can be acquired in linear time, yet for which computing the stable model(s) remains NP-complete. We show in this class how, by relaxing... (Update)
Active bibliography (related documents): More All
0.5: Computing the Well-Founded Semantics Faster - Berman, Schlipf, Franco (1995) (Correct)
0.3: Specifying causality in action theories: A default logic approach - Zhang (1998) (Correct)
0.3: Answer Sets for Prioritized Logic Programs - Zhang, Foo (1997) (Correct)
Similar documents based on text: More All
0.1: Stable ILP: Exploring the Added Expressivity of Negation in the.. - Seitzer (1997) (Correct)
0.1: The Giant Branch of Omega Centauri. The Dependence of.. - Norris, Freeman, al. (Correct)
0.1: INDED: A Distributed Knowledge-Based Learning System - Seitzer, al. (2000) (Correct)
BibTeX entry: (Update)
@inproceedings{ seitzer97affordable,
author = "J. Seitzer and John S. Schlipf",
title = "Affordable Classes of Normal Logic Programs",
booktitle = "Logic Programming and Non-monotonic Reasoning",
pages = "92-111",
year = "1997",
url = "citeseer.ist.psu.edu/182960.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1984 ACM
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1990 DBLP
405 Depth first search and linear graph algorithms (context) - Tarjan - 1972
356 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Jonson - 1979
312 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991 ACM DBLP
174 A kripke-kleene semantics for logic programs (context) - Fitting - 1985 DBLP
154 Introduction to Algorithms (context) - Leiserson - 1991 ACM
151 Autoepistemic logic (context) - Marek, Truszczynski - 1991 ACM DBLP
151 Autoepistemic logic (context) - Marek, Truszczynski - 1988
88 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1988 ACM
88 Every logic program has a natural stratification and and ite.. - Przymusinski - 1989
61 The expressive powers of the logic programming semantics (context) - Schlipf - 1990 ACM DBLP
38 A rational reconstruction of nonmonotonic truth maintenance .. (context) - Elkan - 1990 DBLP
17 Graph theoretical structures in logic programs and default t.. (context) - Dimopoulos, Torres - 1993 ACM DBLP
13 Foundations of Deductive Databases and Logic Programming (context) - Blair, Apt et al. - 1988 ACM DBLP
5 On computing logic programs (context) - Dimopoulos - 1996 DBLP
3 A hierarchy of tractable subsets for computing stable models (context) - Ben-Eliyahu - 1996 DBLP
2 Personal communication (context) - Subrahmanian
1 Doctoral proposal: A study of the well-founded and stable lo.. (context) - Seitzer - 1996
1 chapter A Comparison of Notions of Negation as Failure (context) - Schlipf, Semantics - 1994
Documents on the same site (http://mc.msj.edu/seitzer/papers.htm):
Stable ILP: Exploring the Added Expressivity of Negation in the.. - Seitzer (1997) (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