Formalizing nonmonotonic reasoning systems
Artificial Intelligence
Nonmonotonic reasoning: logical foundations of common sense
Nonmonotonic reasoning: logical foundations of common sense
Default theories that always have extensions
Artificial Intelligence
Reasoning with Incomplete Information
Reasoning with Incomplete Information
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Reasoning with Stratified Default Theories
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Towards efficient default reasoning
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Default Reasoning via Blocking Sets
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
On Bottom-Up Pre-processing Techniques for Automated Default Reasoning
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Query-Answering in Prioritized Default Logic
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Bridging possibilistic conditional knowledge bases and partially ordered bases
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
| Hi-index | 0.00 |
We introduce new concepts for default reasoning in the context of query-answering in regular default logic. For this purpose, we develop a proof-oriented approach for deciding whether a default theory has an extension containing a given query. The inherent problem in Reiter's default logic is that it necessitates the inspection of all default rules for answering no matter what query. Also, default theories are known to lack extensions occasionally. We address these two problems by sloting in a compilation phase before the actual query-answering phase. The examination of the entire set of default rules is then done only once in the compilation phase; this allows us to inspect only the ultimately necessary default rules during the actual query answering phase. In fact, the latter inspection must not only account for the derivability of the query, but moreover it must guarantee the existence of an encompassing extension.We address this traditionally important problem by furnishing novel criteria guaranteeing the existence of extensions that are arguably simpler and go well beyond existing approaches.