Marco Cadoli, et al.  Home/Search
Context Related
| cmu.edu/afs/cs/project...cadoli00a.ps.Z cmu.edu/afs/cs/project/...cadoli00a.pdf 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: jair.org/conten...withabstracts (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the space e#ciency of a Propositional Knowledge Representation (PKR) formalism. Intuitively, the space e#ciency of a formalism F in representing a certain piece of knowledge #, is the size of the shortest formula of F that represents #. In this paper we assume that knowledge is either a set of propositional interpretations (models) or a set of propositional formulae (theorems). We provide a formal way of talking about the relative ability of PKR formalisms to compactly... (Update)
Context of citations to this paper: More
...restricted fragments (monadic theories, etc) would be interesting. Complementing the results on reasoning complexity, Cadoli et al. [7, 6], Gogic et al. 26] Selman and Kautz [46] Darwiche and Marquis [14, 13] and others have studied representability issues among KR...
...of formalisms on average. Our framework is built on notions and insights from the theory of compilability clases due to Cadoli et al. 2000a; 2000b] and the theory of average case time complexity due to Levin [1986] 1.1 Background Compilability. Informally, a formalism...
Cited by: More
Eliminating Disjunction from Propositional Logic.. - Eiter, Fink, Tompits, .. (2003) (Correct)
On Eliminating Disjunctions in Stable Logic Programming - Eiter (2003) (Correct)
A Theory of Average-Case Compilability in Knowledge Representation - Chen (Correct)
Similar documents (at the sentence level):
7.7%: Comparing Space Efficiency of Propositional.. - Cadoli, Donini.. (1996) (Correct)
Active bibliography (related documents): More All
1.6: Preprocessing of Intractable Problems - Cadoli, Donini, Liberatore, Schaerf (2000) (Correct)
0.7: The Compactness of Belief Revision and Update Operators - Liberatore, Schaerf (2000) (Correct)
0.4: Disjunctive Datalog - Eiter, Gottlob, Mannila (1997) (Correct)
Similar documents based on text: More All
0.4: The Size of MDP Factored Policies - Paolo Liberatore Dipartimento (2002) (Correct)
0.4: Compilation of Intractable Problems and Its Application to.. - Liberatore (1998) (Correct)
0.3: AL-log: Integrating Datalog and Description Logics - Donini, Lenzerini, al. (1998) (Correct)
Related documents from co-citation: More All
4: The comparative linguistics of knowledge representation - Gogic, Kautz et al. - 1995
3: On compact representations of propositional circumscription - Cadoli, Donini et al. - 1997
3: Declarative Problem-Solving Using the DLV System (context) - Eiter - 2000
BibTeX entry: (Update)
M. Cadoli, F. Donini, and M. Schaerf. Space efficiency of propositional knowledge representation formalisms. Journal of Artificial Intelligence Research, 13:1--31, 2000. http://citeseer.ist.psu.edu/article/cadoli00space.html More
@article{ cadoli00space,
author = "Marco Cadoli and Francesco M. Donini and Paolo Liberatore and Marco Schaerf",
title = "Space Efficiency of Propositional Knowledge Representation Formalisms",
journal = "Journal of Artificial Intelligence Research",
volume = "13",
pages = "1-31",
year = "2000",
url = "citeseer.ist.psu.edu/article/cadoli00space.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
850 A logic for default reasoning (context) - Reiter - 1980
534 The complexity of theorem-proving procedures (context) - Cook - 1971
451 Circumscription - A form of non-monotonic reasoning (context) - McCarthy - 1980
274 A catalog of complexity classes (context) - Johnson - 1990
185 On indefinite databases and the closed world assumption (context) - Minker - 1982
161 Complexity results for nonmonotonic logics (context) - Gottlob - 1992
151 Autoepistemic logic (context) - Marek, Truszczynski - 1991
141 The complexity of finite functions (context) - Boppana, Sipser - 1990
116 Some connections between non-uniform and uniform complexity .. (context) - Karp, Lipton - 1980
96 the semantics of updates in databases (context) - Fagin, Ullman et al. - 1983
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
91 Artificial Intelligence (context) - Ginsberg - 1986
91 Propositional circumscription and extended closed world reas.. - Eiter, Gottlob - 1993
88 Hard problems for simple default logics - Kautz, Selman - 1991
82 Reasoning with incomplete information (context) - Etherington - 1987
72 Updating Logical Databases (context) - Winslett - 1990
69 The polynomial-time hierarchy (context) - Stockmeyer - 1976
60 Knowledge compilation and theory approximation - Selman, Kautz - 1996
52 Some consequences of non-uniform conditions on uniform class.. (context) - Yap - 1983
49 Horn approximations of empirical data - Kautz, Kearns et al. - 1995
48 Reasoning with models - Khardon, Roth - 1996
43 Forming concepts for fast inference - Kautz, Selman - 1992
43 Propositional semantics for disjunctive logic programs (context) - Ben-Eliyahu, Dechter - 1994
41 The complexity of model checking for circumscriptive formula.. - Cadoli - 1992
38 La Sapienza (context) - Cadoli, Donini et al. - 1997
37 The comparative linguistics of knowledge representation - Gogic, Kautz et al. - 1995
29 Some computational aspects of circumscription (context) - Kolaitis, Papadimitriou - 1990
25 Is intractability of non-monotonic reasoning a real drawback - Cadoli, Donini et al. - 1996
25 On compact representations of propositional circumscription - Cadoli, Donini et al. - 1997
25 On compact representations of propositional circumscription - Cadoli, Donini et al. - 1995
23 Translating default logic into standard autoepistemic logic (context) - Gottlob - 1995
22 How hard is it to revise a belief base - Nebel - 1998
18 A survey of complexity and undecidability results for logic .. (context) - Schlipf - 1995
17 Sometimes updates are circumscription (context) - Winslett - 1989
15 New collapse consequences of NP having small circuits (context) - Kobler, Watanabe - 1998
13 La Sapienza (context) - Liberatore, Schaerf et al. - 2000
13 ilation of intractable problems and its application to artif.. (context) - Liberatore - 1998
12 The complexity of model checking for belief revision and upd.. - Liberatore, Schaerf - 1996
8 Compact representation of revision of Horn clauses - Liberatore - 1995
8 Defaults and relevance in model-based reasoning - Khardon, Roth - 1997
4 Feasibility and unfeasibility of o#-line processing (context) - Cadoli, Donini et al.
3 ciency of propositional knowledge representation formalisms (context) - Cadoli, Donini et al.
3 Default logic (context) - Ben-Eliyahu, Dechter - 1991
3 Decidability and definability with circumscription (context) - Schlipf - 1987
2 line reasoning for on-line e#ciency: knowledge bases (context) - Moses, Tennenholtz - 1996
1 Results on translating defaults to circumscription (context) - Donini, Schaerf - 1987
1 The complexity of model checking for propositional default l.. (context) - of, Representation et al. - 1998
1 The size of a revised knowledge base (context) - of, Representation et al. - 1999
1 the intertranslatability of autoepistemic (context) - Janhunen - 1998
Documents on the same site (http://jair.org/contents/complete-with-abstracts.html): More
Randomized Algorithms for the Loop Cutset Problem - Becker, Bar-Yehuda, Geiger (2000) (Correct)
A Model of Inductive Bias Learning - Baxter (2000) (Correct)
Reasoning on Interval and Point-based Disjunctive Metric.. - Barber (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