Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Belief, awareness, and limited reasoning
Artificial Intelligence
A satisfiability tester for non-clausal propositional calculus
Information and Computation
An algorithm to compute circumscription
Artificial Intelligence
On the relationship between circumscription and negation as failure
Artificial Intelligence
A decidable first-order logic for knowledge representation
Journal of Automated Reasoning
Arithmetic classification of perfect models of stratified programs
Fundamenta Informaticae
Towards a theory of access-limited logic for knowledge representation
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Attributive concept descriptions with complements
Artificial Intelligence
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
An efficient method for eliminating varying predicates from a circumscription
Artificial Intelligence
Approximate reasoning and non-omniscient agents
TARK '92 Proceedings of the fourth conference on Theoretical aspects of reasoning about knowledge
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
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
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
A General Framework for Knowledge Compilation
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
AI*IA Proceedings of the 2nd Congress of the Italian Association for Artificial Intelligence on Trends in Artificial Intelligence
A knowledge-level account of abduction
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Semantical and computational aspects of horn approximations
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Tractable meta-reasoning in propositional logics of belief
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Using model theory to specify AI programs
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Default logic, propositional logic and constraints
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Knowledge compilation using horn approximations
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Forming concepts for fast inference
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
The complexity of propositional default logics
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Logics for Approximate Reasoning: Approximating Classical Logic "From Above"
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
A Logic for Approximate First-Order Reasoning
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
What Is Approximate Reasoning?
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
| Hi-index | 0.00 |
We propose a technique for dealing with the high complexity of reasoning under propositional default logic and circumscription. The technique is based on the notion of approximation: A logical consequence relation is computed by means of sound and progressively “more complete” relations, as well as complete and progressively “more sound” ones. Both sequences generated in this way converge to the original consequence relation and are easier to compute. Moreover they are given a clear semantics based on multivalued logic. With this technique unsoundness and incompleteness are introduced in a controlled way and precisely characterized.