A theory of diagnosis from first principles
Artificial Intelligence
On the relation between default and autoepistemic logic
Artificial Intelligence
A logical framework for default reasoning
Artificial Intelligence
Logic programs with classical negation
Logic programming
Towards automatic autoepistemic reasoning
JELIA '90 Proceedings of the European workshop on Logics in AI
A unifying framework for nonmonotonic reasoning
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ACM Computing Surveys (CSUR)
An argument-based approach to reasoning with specificity
Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Argumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
New Generation Systems for Non-monotonic Reasoning
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Default Reasoning via Blocking Sets
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Preferred Extensions of Argumentation Frameworks: Query Answering and Computation
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
On the expressive power of semi-normal defaults in some semantic variants of default logic
AI Communications - Special issue on Artificial intelligence advances in China
Expressing default abduction problems as quantified Boolean formulas
AI Communications
Hybrid argumentation systems for structured news reports
The Knowledge Engineering Review
A tutorial on default reasoning
The Knowledge Engineering Review
DisLoP: a research project on Disjunctive Logic Programming
AI Communications
On the expressive power of semi-normal defaults in some semantic variants of default logic
AI Communications - Artificial Intelligence Advances in China
Expressing default abduction problems as quantified Boolean formulas
AI Communications
| Hi-index | 0.00 |
A decision method for Reiter's default logic is developed. It can determine whether a default theory has an extension, whether a formula is in some extension of a default theory and whether a formula is in every extension of a default theory. The method handles full propositional default logic. It can be implemented to work in polynomial space and by using only a theorem prover for the underlying propositional logic as a subroutine. The method divides default reasoning into two major subtasks: the search task of examining every alternative for extensions, which is solved by backtracking search, and the classical reasoning task, which can be implemented by a theorem prover for the underlying classical logic. Special emphasis is given to the search problem. The decision method employs a new compact representation of extensions which reduces the search space. Efficient techniques for pruning the search space further are developed.