| Alternate document: Details A Survey of Complexity Results for Planning (93) Marco Cadoli |
Marco Cadoli, Marco Schaerf  Home/Search
Context Related
| dis.uniroma1.it/PU...doscha93b.ps.gz dis.uniroma1.it/pu...doscha93b.ps.gz 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 Problem Downloading? From: hermes.dis.uniroma...publications (more) From: dis.uniroma1.it...lications.shtml (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper surveys the main results appeared in the literature on the computational complexity of non-monotonic inference tasks. We not only give results about the tractability/intractability of the individual problems but we also analyze sources of complexity and explain intuitively the nature of easy/hard cases. We focus mainly on non-monotonic formalisms, like default logic, autoepistemic logic, circumscription, closed-world reasoning and abduction, whose relations with logic programming are ... (Update)
Context of citations to this paper: More
.... first level of the polynomial hierarchy for LP and on the second level for logics with full propositional logic as the underlying logic [3]. However, previous results on the expressive power of DATALOG queries by Sacca [28] suggest that this is not the case for LP. Indeed,...
Cited by: More
A proof theoretical approach to default reasoning I.. - Amati, Aiello.. (1995) (Correct)
MirrorSEEk System Architecture - van Doorn (2001) (Correct)
Disjunctive Logic Programming: A Survey And Assessment - Minker, Seipel (Correct)
Active bibliography (related documents): More All
1.5: On the Computational Cost of Disjunctive Logic Programming.. - Eiter, Gottlob (1995) (Correct)
1.2: Autoepistemic Logic As A Unified Basis For Nonmonotonic Reasoning - Niemelä (1993) (Correct)
1.0: An Overview of Nonmonotonic Reasoning and Logic Programming - Minker (1993) (Correct)
Similar documents based on text: More All
0.3: Approximate Inference in Default Logic and Circumscription - Cadoli, Schaerf (1992) (Correct)
0.3: Tractable Reasoning via Approximation - Schaerf, Cadoli (1995) (Correct)
0.3: Is Intractability of Non-Monotonic Reasoning a Real Drawback? - Cadoli, Donini, Schaerf (1996) (Correct)
Related documents from co-citation: More All
33: Complexity Results for Nonmonotonic Logics (context) - Gottlob - 1992
23: A Logic for Default Reasoning (context) - Reiter - 1980
20: Propositional Circumscription and Extended Closed World Reasoning are \Pi p 2 -c.. - Eiter - 1993
BibTeX entry: (Update)
M. Cadoli and M. Schaerf. A survey of complexity results for nonmonotonic logics. Journal of Logic Programming, 17, 127--160, 1993. http://citeseer.ist.psu.edu/cadoli93survey.html More
@article{ cadoli93survey,
author = "Marco Cadoli and Marco Schaerf",
title = "A Survey of Complexity Results for Nonmonotonic Logics",
journal = "Journal of Logic Programming",
volume = "17",
number = "2/3&4",
pages = "127-160",
year = "1993",
url = "citeseer.ist.psu.edu/cadoli93survey.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988 DBLP
850 A logic for default reasoning (context) - Reiter - 1980 ACM DBLP
759 Negation as failure (context) - Clark - 1978 ACM DBLP
451 Circumscription - a form of non-monotonic reasoning (context) - McCarthy - 1980 ACM DBLP
435 Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988 ACM DBLP
416 A new method for solving hard satisfiability problems - Selman, Levesque et al. - 1992 DBLP
374 Classical negation in logic programs and disjunctive databas.. - Gelfond, Lifschitz - 1991 DBLP
312 The well-founded semantics for general logic programs - van Gelder, Ross et al. - 1991 ACM DBLP
311 Semantical considerations on nonmonotonic logic (context) - Moore - 1985 ACM DBLP
297 Applications of circumscription to formalizing common-sense .. - McCarthy - 1986 ACM DBLP
295 On closed world data bases (context) - Reiter - 1978
274 A catalog of complexity classes (context) - Johnson - 1990 ACM DBLP
235 First Order Logic (context) - Smullyan - 1968 ACM
229 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1967 ACM
218 Logic programming and databases (context) - Ceri, Gottlob et al. - 1990 ACM DBLP
191 Linear-time algorithms for testing the satisfiability of pro.. (context) - Dowling, Gallier - 1984 DBLP
189 Foundations of Disjunctive Logic Programming (context) - Lobo, Minker et al. - 1992 ACM
186 Negation in logic programming (context) - Kunen - 1987 ACM DBLP
185 On indefinite databases and the closed world assumption (context) - Minker - 1982
166 Computing circumscription (context) - Lifschitz - 1985 ACM DBLP
161 Complexity results for nonmonotonic logics (context) - Gottlob - 1992 DBLP
151 Autoepistemic logic (context) - Marek, Truszczy'nski - 1991 ACM DBLP
146 Introduction to logic programming (context) - Apt - 1990 ACM DBLP
130 The computational complexity of provability in systems of mo.. (context) - Ladner - 1977 DBLP
129 What does a conditional knowledge base entail (context) - Lehmann, Magidor - 1992
120 Stable semantics for disjunctive programs - Przymusinski - 1991 DBLP
118 Non-monotonic logic (context) - McDermott, Doyle - 1980
117 Abduction compared with negation by failure (context) - Eshghi, Kowalski - 1989 DBLP
115 The alternating fixpoint of logic programs with negation (context) - van Gelder - 1989 ACM DBLP
100 Theorist: A logical reasoning system for defaults and diagno.. (context) - Poole, Goebel et al. - 1987
96 the relationship between circumscription and negation as fai.. (context) - Gelfond, Przymusinska et al. - 1989
96 the complexity of propositional knowledge base revision - Eiter, Gottlob - 1992
94 Information Processing Letters (context) - Krishnaprasad, computability - 1988
91 Propositional circumscription and extended closed world reas.. - Eiter, Gottlob - 1991
90 The computational complexity of abduction - Bylander, Allemang et al. - 1991 ACM DBLP
88 Hard problems for simple default logics - Kautz, Selman - 1991 ACM DBLP
87 Abductive and default reasoning: A computational core (context) - Selman, Levesque - 1990 DBLP
84 The complexity of logic-based abduction - Eiter, Gottlob - 1993 ACM DBLP
82 Reasoning with incomplete information (context) - Etherington - 1987 ACM
79 On stratified autoepistemic theories (context) - Gelfond - 1987 DBLP
74 A skeptical theory of inheritance in nonmonotonic semantic n.. (context) - Horty, Thomason et al. - 1990 ACM DBLP
72 New Generation Computing (context) - Apt, Bezem - 1991
72 Belief revision and default reasoning: Syntax-based approach.. - Nebel - 1991 DBLP
72 A fundamental tradeoff in knowledge representation and reaso.. (context) - Brachman, Levesque - 1985
67 A circumscriptive theorem prover - Ginsberg - 1989 ACM DBLP
65 Why not negation by fixpoint (context) - Kolaitis, Papadimitriou - 1991
63 Diagnostic expert systems based on a set covering model (context) - Reggia, Nau et al. - 1983 DBLP
62 Non-monotonic logic II: Non-monotonic modal theories (context) - McDermott - 1982
59 Rank-based systems: A simple approach to belief revision (context) - Goldszmidt, Pearl - 1992
59 On selecting a satisfying truth assignment (context) - Papadimitriou - 1991
56 An algorithm to compute circumscription (context) - Przymusinski - 1989 ACM DBLP
56 A knowledge-level analysis of belief revision - Nebel - 1989
54 the declarative semantics of stratified deductive databases .. (context) - Przymusinski - 1988
54 Inferring negative information from a disjunctive database (context) - Ross, Topor - 1988
52 the declarative semantics of logic programs with negation (context) - Lifschitz - 1988
50 Probabilistic semantics for nonmonotonic reasoning: A survey (context) - Pearl - 1991 ACM DBLP
49 Weak generalized closed world assumption (context) - Rajasekar, Lobo et al. - 1989 ACM DBLP
48 Embedding defaults into terminological knowledge representat.. - Baader, Hollunder - 1992 DBLP
48 The complexity of propositional default logics (context) - Stillman - 1992 DBLP
46 Modal nonmonotonic logics: Ranges (context) - Marek, Shvarts et al. - 1991
44 Deduction in non-Horn databases (context) - Yahya, Henschen - 1985 DBLP
43 Propositional semantics for disjunctive logic programming (context) - Ben-Eliyahu, Dechter - 1992
41 The complexity of model checking for circumscriptive formula.. - Cadoli - 1992 ACM DBLP
33 An overview of nonmonotonic reasoning and logic programming - Minker - 1991 ACM DBLP
33 Negation by default and unstratifiable logic programs (context) - Bidoit, Froidevaux - 1991 ACM DBLP
33 the decidability and complexity of autoepistemic reasoning (context) - Niemela - 1992
33 Computing intersection of autoepistemic expansions (context) - Marek, Truszczy'nski - 1991 DBLP
31 Stable semantics for logic programs and default theories (context) - Marek, Truszczy'nski - 1989 DBLP
31 It's not my default: The complexity of membership problems i.. (context) - Stillman - 1990 DBLP
30 The Problem of Incomplete Information in Relational Database.. (context) - Grahne - 1991
29 Closed-world databases and circumscription (context) - Lifschitz - 1985 ACM DBLP
29 Some computational aspects of circumscription (context) - Kolaitis, Papadimitriou - 1990 ACM DBLP
28 Hierarchical knowledge bases and efficient disjunctive reaso.. - Borgida, Etherington - 1989 ACM DBLP
28 Circumscription implies predicate completion (context) - Reiter - 1982
27 Complexity aspects of various semantics for disjunctive data.. - Eiter, Gottlob - 1992 ACM DBLP
26 Recursion-Theoretic Hierarchies (context) - Hinman - 1978
26 Negation in rule-based database languages: a survey (context) - Bidoit - 1991 DBLP
25 Autoepistemic modal logics (context) - Shvarts - 1990 ACM DBLP
25 The relationship between logic program semantics and non-mon.. (context) - Marek, Subrahmanian - 1989 DBLP
25 Tableaux and sequent calculus for minimal entailment (context) - Olivetti - 1992 DBLP
24 Annals of Mathematics and Artificial Intelligence (context) - Marek, Truszczy'nski et al. - 1990 ACM
24 Negation as failure: Careful closure procedure (context) - Gelfond, Przymusinska - 1986 ACM DBLP
24 Querying logical databases (context) - Vardi - 1986 ACM DBLP
24 Resolving ambiguity in nonmonotonic inheritance hierarchies (context) - Stein - 1992 ACM DBLP
24 nonmonotonic reasoning and the closed world assumption (context) - Bossu, Siegel - 1985
22 A possible worlds semantics for disjunctive databases - Chan - 1992
22 Annals of Mathematics and Artificial Intelligence (context) - Schlipf, for et al. - 1992 ACM
22 Model-preference default theories (context) - Selman, Kautz - 1990 ACM DBLP
22 The tractability of path-based inheritance (context) - Selman, Levesque - 1989 ACM DBLP
21 Complexity results for disjunctive logic programming and app.. - Eiter, Gottlob - 1992 ACM DBLP
21 propositional logic and constraints (context) - Ben-Eliyahu, Dechter - 1991
20 Results on translating defaults to circumscription (context) - Imielinski - 1987 ACM DBLP
20 Relating default logic and circumscription (context) - Etherington - 1987 DBLP
19 Computational complexity of hypothesis assembly (context) - Allemang, Tanner et al. - 1987
18 A survey of complexity and undecidability results in logic p.. (context) - Schlipf - 1992 DBLP
18 The stable models of a predicate logic program - Marek, Nerode et al. - 1992 DBLP
18 Reasoning with parsimonious and moderately grounded expansio.. (context) - Eiter, Gottlob - 1992 ACM
18 A logic of knowledge and justified assumptions (context) - Lin, Shoham - 1992 ACM DBLP
17 Computing circumscriptive databases (context) - Nerode, Ng et al. - 1992
16 the complexity of unique solutions (context) - Papadimitriou - 1984
15 Implementing deductive databases by linear programming (context) - Bell, Nerode et al. - 1992 ACM DBLP
13 the relationship between default and autoepistemic logic (context) - Konolige - 1988
13 Non-Monotonic Reasoning (context) - Lukaszewicz - 1990 ACM
13 Removing redundancy from a clause (context) - Gottlob, Fermuller - 1993 ACM DBLP
13 Higher order logic (context) - van Benthem, Doets - 1983 ACM
12 On theorem provers for circumscription (context) - Inoue, Helft - 1990 ACM
12 Annals of Pure and Applied Logic (context) - Schlipf, definability - 1987
11 A tableaux-based theorem prover for a decidable subset of de.. (context) - Schwind - 1990 ACM
11 Non-monotonic formalisms and logic programming - Przymusinski - 1989 DBLP
10 the complexity of model finding for nonmonotonic proposition.. (context) - Cadoli - 1992
10 General logic databases and programs: default logic semantic.. (context) - Bidoit, Froidevaux - 1991
10 Eliminating the fixed predicates from a circumscription (context) - de Kleer, Konolige - 1989 ACM DBLP
9 A theory of nonmonotonic rule systems II (context) - Marek, Nerode et al. - 1992 DBLP
9 An efficient method for eliminating varying predicates from .. - Cadoli, Eiter et al. - 1992 ACM DBLP
8 the classification and existence of structures in default lo.. (context) - Zhang, Marek - 1990
8 The monotonic abduction problem: A functional characterizati.. (context) - Bylander - 1991 DBLP
8 The generalized completeness of Horn predicate logic as a pr.. (context) - Andreka, Nemeti - 1978
8 the impact of stratification on the complexity of nonmonoton.. - Niemela, Rintanen - 1992
8 Tie-breaking semantics and structural totality (context) - Papadimitriou, Yannakakis - 1992 ACM DBLP
8 A generalization of collapsible cases of circumscription (context) - Rabinov - 1989 ACM DBLP
7 abductive diagnosis and therapy (context) - Friedrich, Gottlob et al. - 1990
7 The complexity of nested counterfactuals and iterated knowle.. - Eiter, Gottlob - 1992
7 On finding extensions of default theories (context) - Papadimitriou, Sideri - 1992 ACM DBLP
6 Logic programming and autoepistemic logics: new relations an.. - Schaerf - 1992 DBLP
6 The complexity of propositional default reasoning under the .. (context) - Gottlob - 1992
6 Minimal consequence in sentential logic (context) - Papalaskari, Weinstein - 1990 DBLP
6 Generalized closed world assumption is \Pi 0 2 -complete (context) - Chomicki, Subrahmanian - 1990
6 The computational complexity of multiple-context truth maint.. (context) - Provan - 1990 DBLP
5 Negation as stable hypothesis (context) - Kakas, Mancarella - 1991
4 When is closed world reasoning tractable (context) - Schlipf - 1988
4 A complexity analysis of assumption-based truth maintenance .. (context) - Provan - 1988 ACM
4 The expressiveness of locally stratified programs (context) - Blair, Marek et al. - 1992 DBLP
4 A graph theoretic approach to default logic (context) - Dimopoulos, Magirou - 1992
4 The recursion-theoretic complexity of the semantics of predi.. (context) - Blair - 1982
3 Nonmonotonic reasoning is sometimes easier (context) - Schwarz, Truszczynski - 1992
3 Presented at the 4th International Workshop on Nonmonotonic .. (context) - Etherington, Crawford et al. - 1992
3 justification and non-monotonicity in deductive databases (context) - Bidoit, Hull - 1989
2 School of Computer and Information Science (context) - Cholak, Blair et al. - 1991
2 On reducing parallel circumscription (context) - Yuan - 1988 DBLP
1 Computational complexity of truth maintenance systems (context) - Rutenburg - 1991
1 Presented at the 4th International Workshop on Nonmonotonic .. (context) - Przymusinska, Przymusinsky et al. - 1992
1 Presented at the Workshop on Nonstandard queries and answers (context) - Grahne, Mendelzon et al. - 1991
1 Post correspondence problem and Prolog programs (context) - Cholak - 1988
1 Tractable abduction (context) - Eshghi - 1992
1 Negation as failure: A comparison of Clark's completed data .. (context) - Sheperdson - 1984
1 Artificial Intelligence Journal (context) - de Kleer - 1986
1 The expressive powers of the logic programming sematics (context) - Schlipf - 1990
1 Mapping complexity results from circumscription to default l.. (context) - Cadoli, Lenzerini - 1991
1 Artificial Intelligence Review (context) - Donini, Lenzerini et al. - 1990
1 Presented at the First International Workshop on Nonmonotoni.. (context) - Grosof, as - 1984
1 Circumscription and nonmonotonic inheritance (context) - Cadoli, Lenzerini et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://hermes.dis.uniroma1.it/~schaerf/publications.html): More
Tractable Reasoning via Approximation - Schaerf, Cadoli (1995) (Correct)
Negation And Minimality In Disjunctive Databases - Schaerf (1995) (Correct)
On Compact Representations of Propositional.. - Cadoli, Donini, Schaerf, .. (1995) (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