Marco Cadoli, Francesco M. Donini, Marco Schaerf  Home/Search
Context Related
| dis.uniroma1.it/pu...donischa94.ps.gz dis.uniroma1.it/PU...donischa94.ps.gz dis.uniroma1.it/pu...donischa94.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 From: hermes.dis.uniroma1.i...Doninibib (more) From: hermes.dis.uniroma...publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Several studies about complexity of NMR showed that inferring in non-monotonic knowledge bases is significantly harder than reasoning in monotonic ones. This contrasts with the general idea that NMR can be used to make knowledge representation and reasoning simpler, not harder. In this paper we show that, to some extent, NMR has fulfilled its goal. In particular we prove that circumscription allows for more compact and natural representation of knowledge. Results about intractability of... (Update)
Context of citations to this paper: More
.... the cases studied, the complexity of NMR is much worse compared to the complexity of the first order logic, for example (as discussed in [5]) the reasoning task of deciding if a literal follows from a propositional Horn formula can be done in linear time in first order logic...
.... of papers compared the compilability of different formalisms [Kautz et al. 1995; Gogic et al. 1995; Khardon and Roth, 1996; Cadoli et al. 1996; 1997; 1999; 2000a; 2000b] In many cases, these papers rigorously prove that one formalism B is strictly more succinct than...
Cited by: More
Alternative foundations for Reiter's default logic - Linke, Schaub (2000) (Correct)
Knowledge compilation = Query rewriting + View synthesis - Cadoli, Mancini (Correct)
A Theory of Average-Case Compilability in Knowledge Representation - Chen (Correct)
Similar documents (at the sentence level):
35.2%: Is Intractability of Non-Monotonic Reasoning a Real Drawback? - Cadoli, Donini, Schaerf (1995) (Correct)
Active bibliography (related documents): More All
0.4: Space Efficiency of Propositional Knowledge Representation.. - Cadoli, al. (2000) (Correct)
0.3: Disjunctive Datalog - Eiter, Gottlob, Mannila (1997) (Correct)
0.1: A Survey on Complexity Results for Non-monotonic Logics - Cadoli, Schaerf (1993) (Correct)
Similar documents based on text: More All
0.4: Toward Efficient Default Reasoning - Etherington, Crawford (1996) (Correct)
0.4: On Compact Representations of Propositional.. - Cadoli, Donini, Schaerf, .. (1995) (Correct)
Related documents from co-citation: More All
16: Propositional Circumscription and Extended Closed World Reasoning are \Pi p 2 -c.. - Eiter - 1993
16: Complexity Results for Nonmonotonic Logics (context) - Gottlob - 1992
13: On compact representations of propositional circumscription - Cadoli, Donini et al. - 1997
BibTeX entry: (Update)
M. Cadoli, F. M. Donini, and M. Schaerf. Is intractability of non-monotonic reasoning a real drawback? Artificial Intelligence Journal, 88(1--2):215--251, 1996. http://citeseer.ist.psu.edu/article/cadoli96is.html More
@inproceedings{ cadoli94is,
author = "Marco Cadoli and Francesco M. Donini and Marco Schaerf",
title = "Is Intractability of Non-Monotonic Reasoning a Real Drawback?",
booktitle = "National Conference on Artificial Intelligence",
pages = "946-951",
year = "1994",
url = "citeseer.ist.psu.edu/article/cadoli96is.html" }
Citations (may not include all citations):297 Applications of circumscription to formalizing common-sense .. - McCarthy - 1986
295 On closed world data bases (context) - Reiter - 1978
274 A catalog of complexity classes (context) - Johnson - 1990
191 Lineartime algorithms for testing the satisfiability of prop.. (context) - Dowling, Gallier - 1984
166 Computing circumscription (context) - Lifschitz - 1985
143 the complexity of timetable and multicommodity flow problems (context) - Even, Itai et al. - 1976
97 Knowledge compilation using Horn approximations - Selman, Kautz - 1991
88 Hard problems for simple default logics - Kautz, Selman - 1991
58 A survey of complexity results for non-monotonic logics - Cadoli, Schaerf - 1993
48 Embedding defaults into terminological knowledge representat.. - Baader, Hollunder - 1992
47 and Shapiro (context) - Sterling - 1986
43 Forming concepts for fast inference - Kautz, Selman - 1992
25 On compact representations of propositional circumscription - Cadoli, Donini et al. - 1994
17 Off-line reasoning for on-line efficiency (context) - Moses, Tennenholtz - 1993
14 The future of knowledge representation (context) - Brachman - 1990
10 the complexity of model finding for nonmonotonic proposition.. (context) - Cadoli, On - 1992
3 Decidability and definability with circumscription (context) - Schlipf - 1987
1 Complexity results for nonmonotonic logics (context) - of, -- - 1992
1 Some connections between non-uniform and uniform complexity .. (context) - van Leeuwen, ed et al. - 1980
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://hermes.dis.uniroma1.it/~donini/Doninibib.html): More
A Uniform Tableaux Method for Nonmonotonic Modal Logics - Donini, Massacci, Nardi.. (1996) (Correct)
Comparing Space Efficiency of Propositional.. - Cadoli, Donini.. (1996) (Correct)
On Compact Representations of Propositional Circumscription - Cadoli, Donini, Schaerf (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