Relating defeasible and default logic

7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Antoniou, G., & Billington, D. (2001). Relating defeasible and default logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2256, pp. 13–24). Springer Verlag. https://doi.org/10.1007/3-540-45656-2_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free