Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Model-preference default theories
Artificial Intelligence
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
The complexity of propositional closed world reasoning and circumscription
Journal of Computer and System Sciences
Incremental recompilation of knowledge (extended abstract)
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Is intractability of non-monotonic reasoning a real drawback?
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Horn approximations of empirical data
Artificial Intelligence
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The future of computational complexity theory: part I
ACM SIGACT News
Elaboration tolerance of logical theories
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Compilability and compact representations of revision of Horn knowledge bases
ACM Transactions on Computational Logic (TOCL)
Proof-complexity results for nonmonotonic reasoning
ACM Transactions on Computational Logic (TOCL)
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
Knowledge compilation = query rewriting + view synthesis
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the intertranslatability of non-monotonic logics
Annals of Mathematics and Artificial Intelligence
Propositional default logics made easier: computational complexity of model checking
Theoretical Computer Science
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Succinct Representations of Model Based Belief Revision
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Preprocessing of intractable problems
Information and Computation
The size of MDP factored policies
Eighteenth national conference on Artificial intelligence
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
On Stratified Belief Base Compilation
Annals of Mathematics and Artificial Intelligence
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
Artificial Intelligence
Towards a mathematical theory of knowledge
Journal of Computer Science and Technology
A survey on knowledge compilation
AI Communications
Translating owl and semantic web rules into prolog: Moving toward description logic programs
Theory and Practice of Logic Programming
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction
Journal of Computer Science and Technology
Extending the Knowledge Compilation Map: Closure Principles
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Extending the knowledge compilation map: Krom, Horn, affine and beyond
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New compilation languages based on structured decomposability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
On the compilability and expressive power of propositional planning formalisms
Journal of Artificial Intelligence Research
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A theory of average-case compilability in knowledge representation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Complexity of nested circumscription and abnormality theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A perspective on knowledge compilation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Artificial Intelligence
Knowledge compilation properties of trees-of-BDDs, revisited
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Database theory: query languages
Algorithms and theory of computation handbook
The complexity of model checking for belief revision and update
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Contextual reasoning is NP-complete
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Toward efficient default reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Existential closures for knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
On the relative succinctness of two extensions by definitions of multimodal logic
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
On the succinctness of some modal logics
Artificial Intelligence
Towards a knowledge compilation map for heterogeneous representation languages
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Semiring labelled decision diagrams, revisited: canonicity and spatial efficiency issues
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.05 |
We develop a methodology for comparing knowledge representation formalisms in terms of their "representational succinctness," that is, their ability to express knowledge situations relatively efficiently. We use this framework for comparing many important formalisms for knowledge base representation: propositional logic, default logic, circumscription, and model preference defaults; and, at a lower level, Horn formulas, characteristic models, decision trees, disjunctive normal form, and conjunctive normal form. We also show that adding new variables improves the effective expressibility of certain knowledge representation formalisms.