Artificial Intelligence
Results on translating defaults to circumscription
Artificial Intelligence
On the relationship between circumscription and negation as failure
Artificial Intelligence
Some computational aspects of circumscription
Journal of the ACM (JACM)
Updating logical databases
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
The complexity of model checking for circumscriptive formulae
Information Processing Letters
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
Horn approximations of empirical data
Artificial Intelligence
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Off-line reasoning for on-line efficiency: knowledge bases
Artificial Intelligence
Artificial Intelligence
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
On compact representations of propositional circumscription
Theoretical Computer Science
Defaults and relevance in model-based reasoning
Artificial Intelligence - Special issue on relevance
New Collapse Consequences of NP Having Small Circuits
SIAM Journal on Computing
The size of a revised knowledge base
Artificial Intelligence
Reasoning with Incomplete Information
Reasoning with Incomplete Information
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
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 comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The complexity of model checking for belief revision and update
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
IEEE Transactions on Computers
Compilability of propositional abduction
ACM Transactions on Computational Logic (TOCL)
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
Where fail-safe default logics fail
ACM Transactions on Computational Logic (TOCL)
Reasoning under minimal upper bounds in propositional logic
Theoretical Computer Science
Semantic forgetting in answer set programming
Artificial Intelligence
Model Checking and Preprocessing
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
A theory of average-case compilability in knowledge representation
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A Kripkean semantics for dynamic logic programming
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Compactly representing utility functions using weighted goals and the max aggregator
Artificial Intelligence
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We investigate the space efficiency of a Propositional Knowledge Representation (PKR) formalism. Intuitively, the space efficiency 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 represent a set of models or a set of theorems. We introduce two new compactness measures, the corresponding classes, and show that the relative space efficiency of a PKR formalism in representing models/theorems is directly related to such classes. In particular, we consider formalisms for nonmonotonic reasoning, such as circumscription and default logic, as well as belief revision operators and the stable model semantics for logic programs with negation. One interesting result is that formalisms with the same time complexity do not necessarily belong to the same space efficiency class.