Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Reasoning about priorities in default logic
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Inheritance comes of age: applying nonmonotonic techniques to problems in industry
Artificial Intelligence - Special issue: artificial intelligence 40 years later
A declarative approach to business rules in contracts: courteous logic programs in XML
Proceedings of the 1st ACM conference on Electronic commerce
Representation results for defeasible logic
ACM Transactions on Computational Logic (TOCL)
A Flexible Framework for Defeasible Logics
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
On the Analysis of Regulations using Defeasible Rules
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 6 - Volume 6
Efficient defeasible reasoning systems
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
A clash of intuitions: the current state of nonmonotonic multiple inheritance systems
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
Trust in Secure Communication Systems - The Concept, Representations, and Reasoning Techniques
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Towards Context Sensitive Defeasible Rules
Computational Logic in Multi-Agent Systems
A fixed-point semantics for plausible logic
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we will compare an ambiguity propagating defeasible logic with default logic. In fact the two logics take rather contrary approaches: defeasible logic takes a directly deductive approach, whereas default logic is based on alternative possible world views, called extensions. Computational complexity results suggest that default logics are more expressive than defeasible logics. This paper answers the opposite direction: an ambiguity propagating defeasible logic can be directly embedded into default logic.