LiU Electronic Press
Full-text not available in DiVA
Author:
Madalinska-Bugaj, E
Lukaszewicz, Witold (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Title:
Formalizing defeasible logic in CAKE
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Article in journal (Refereed)
Language:
English
Publisher: IOS Press
Status:
Published
In:
Fundamenta Informaticae(ISSN 0169-2968)
Volume:
57
Issue:
2-3
Pages:
193-213
Year of publ.:
2003
URI:
urn:nbn:se:liu:diva-48416
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-48416
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
Abstract(en) :

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.

Available from:
2009-10-11
Created:
2009-10-11
Last updated:
2011-02-27
Statistics:
8 hits