liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Formalizing defeasible logic in CAKE
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
2003 (English)In: Fundamenta Informaticae, ISSN 0169-2968, Vol. 57, no 2-3, 193-213 p.Article in journal (Refereed) Published
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.

Place, publisher, year, edition, pages
IOS Press , 2003. Vol. 57, no 2-3, 193-213 p.
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-48416OAI: diva2:269312
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2011-02-27

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lukaszewicz, Witold
By organisation
The Institute of TechnologyKPLAB - Knowledge Processing Lab
In the same journal
Fundamenta Informaticae
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

Total: 97 hits
ReferencesLink to record
Permanent link

Direct link