Journal of Logic Programming
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Prioritized conflict handing for logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
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
A Denotational Semantics of Defeasible Logic
CL '00 Proceedings of the First International Conference on Computational Logic
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
Propositional defeasible logic has linear complexity
Theory and Practice of Logic Programming
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
| 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 establish close links to known semantics of extended logic programs. In particular, we give a translation of a defeasible theory D into a program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the answer set semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all answer sets of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.