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

Direct link
Formalizing defeasible logic in CAKE
2003 (English)In: Fundamenta Informaticae, ISSN 0169-2968, Vol. 57, no 2-3, 193-213Artikel i tidskrift (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.

National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-48416 (URN)oai:DiVA.org:liu-48416 (OAI)
Available from2009-10-11 Created:2009-10-11 Last updated:2011-02-27

Open Access in DiVA

No fulltext

Search in DiVA

By author/editor
Madalinska-Bugaj, ELukaszewicz, 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
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Citations

Web of Science®:
Totalt: 8 hits
ReferencesLink to record
Permanent link

Direct link