Formalizing Defeasible Logic in CAKE

Issue title: The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)

Article type: Research Article

Authors: Madalińska-Bugaj, Ewa | Łukaszewicz, Witold

Affiliations: Institute of Informatics, Warsaw University, Banacha 2, Warsaw, Poland | Department of Computer Science, Linköping University and College of Economics and Computer Science, TWP, Olsztyn, Poland

Abstract: Due to its efficiency, defeasible logic is one of the most interesting non-monotonic formalisms. Unfortunately, the logic has one major limitation: it does not properly deal with cyclic defeasible rules. In this paper, we provide a new variant of defeasible logic, using CAKE method. The resulting formalism is tractable and properly deals with circular defeasible rules.

Keywords:

Journal: Fundamenta Informaticae, vol. 57, no. 2-4, pp. 193-213, 2003