Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. Antoniou. Nonmonotonic Reasoning. MIT Press 1997.
G. Antoniou, D. Billington and M.J. Maher. On the analysis of regulations using defeasible rules. In Proc. 32nd Hawaii International Conference on Systems Science, 1999.
G. Antoniou, D. Billington, G. Governatori and M.J. Maher. A flexible framework for defeasible logics. In Proc. 17th American National Conference on Artificial Intelligence (AAAI-2000), 405–41.
G. Antoniou, D. Billington, G. Governatori and M.J. Maher. Representation results for defeasible logic. ACM Transactions on Computational Logic (in print)
G. Brewka. Reasoning About Priorities in Default Logic. In Proc. AAAI-94, 940–945.
G. Gottlob 1992. Complexity results for nonmonotonic logics. Journal of Logic and Computation 2: 397–425.
G. Governatori, A. ter Hofstede and P. Oaks. Defeasible Logic for Automated Negotiation. In Proc. Fifth CollECTeR Conference on Electronic Commerce, Brisbane 2000.
B.N. Grosof, Y. Labrou and H.Y. Chan. A Declarative Approach to Business Rules in Contracts: Courteous Logic Programs in XML. In Proc. 1st ACM Conference on Electronic Commerce (EC-99), ACM Press 1999.
H.A. Kautz and B. Selman. Hard problems for simple default theories. Artificial Intelligence 28 (1991): 243–279.
M.J. Maher, A. Rock, G. Antoniou, D. Billington and T. Miller. Efficient Defeasible Reasoning Systems. In Proc. 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), IEEE 2000, 384–392.
V. Marek and M. Truszczynski. Nonmonotonic Logic, Springer 1993.
L. Morgenstern. 1998. Inheritance Comes of Age: Applying Nonmonotonic Techniques to Problems in Industry. Artificial Intelligence, 103 (1998): 1–34.
D. Nute. 1994. Defeasible Logic. In D.M. Gabbay, C.J. Hogger and J.A. Robinson (eds.): Handbook of Logic in Artificial Intelligence and Logic Programming Vol. 3, Oxford University Press, 353–395.
H. Prakken. 1997. Logical Tools for Modelling Legal Argument: A Study of Defeasible Reasoning in Law. Kluwer Academic Publishers.
D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), AAAI Press / MIT Press, 1999.
R. Reiter. A Logic for Default Reasoning. Artificial Intelligence 13(1980): 81–132.
D.D. Touretzky, J.F. Horty and R.H. Thomason. 1987. A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems. In Proc. IJCAI-87, 476–482, Morgan Kaufmann, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Antoniou, G., Billington, D. (2001). Relating Defeasible and Default Logic. In: Stumptner, M., Corbett, D., Brooks, M. (eds) AI 2001: Advances in Artificial Intelligence. AI 2001. Lecture Notes in Computer Science(), vol 2256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45656-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-45656-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42960-9
Online ISBN: 978-3-540-45656-8
eBook Packages: Springer Book Archive