Explanation and prediction: an architecture for default and abductive reasoning
Computational Intelligence
Hierarchical knowledge bases and efficient disjunctive reasoning
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Hard problems for simple default logics
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Access-limited logic: a language for knowledge representation
Access-limited logic: a language for knowledge representation
Is intractability of non-monotonic reasoning a real drawback?
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
TINLAP '78 Proceedings of the 1978 workshop on Theoretical issues in natural language processing
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A non-deterministic semantics for tractable inference
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Splitting Finite Default Theories: A Comparison of Two Approaches
Journal of Logic, Language and Information
A comparison of two approaches to splitting default theories
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Computation of Extensions of Seminormal Default Theories
Fundamenta Informaticae
Hi-index | 0.00 |
Early work on default reasoning aimed to formalize the notion of quickly "jumping to conclusions". Unfortunately, the resulting formalisms have proven more computationally complex than classical logics. This has dramatically limited the applicability of formal methods to real problems involving defaults. The complexity of consistency checking is one of the two problems that must be addressed to reduce the complexity of default reasoning. We propose to approximate consistency checking using a novel synthesis of limited contexts and fast incomplete checks, and argue that this combination overcomes the limitations of its component parts. Our approach trades correctness for speed, but we argue that the nature of default reasoning makes this trade relatively inexpensive and intuitively plausible. We present a prototype implementation of a default reasoner based on these ideas, and a preliminary empirical evaluation.