Semantical considerations on nonmonotonic logic
Artificial Intelligence
Results on translating defaults to circumscription
Artificial Intelligence
On the relation between default and autoepistemic logic
Artificial Intelligence
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Cumulative default logic: in defense of nonmonotonic inference rules
Artificial Intelligence
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Alternative approaches to default logic
Artificial Intelligence
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
Default reasoning using classical logic
Artificial Intelligence
Querying disjunctive databases through nonmonotonic logics
Theoretical Computer Science
ACM Computing Surveys (CSUR)
Monotonic reductions, representative equivalence, and compilation of intractable problems
Journal of the ACM (JACM)
A Framework for Default Logics
JELIA '92 Proceedings of the European Workshop on Logics in AI
Computing Extensions of Default Theories
ECSQAU Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic
Proceedings of the 10th International Conference on Automated Deduction
Preprocessing of intractable problems
Information and Computation
Evaluating the effect of semi-normality on the expressiveness of defaults
Artificial Intelligence
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Constrained and rational default logics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
| Hi-index | 0.00 |
Reiter's original definition of default logic allows for the application of a default that contradicts one previously applied. We call this condition failure. The possibility of generating failures has been in the past considered a semantical problem, and variants have been proposed to solve it. We show that it is instead a computational feature that is needed to encode some domains into default logic.