Formalizing Defeasible Logic in CAKE

Authors:
Ewa Madalińska-Bugaj;Witold Łukaszewicz
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
Venue:
Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
Year:
2003

Citing 8
Cited 0

Defeasible reasoning and decision support systems

Decision Support Systems
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
On the declarative semantics of logic programs with negation

Foundations of deductive databases and logic programming
Well-founded semantics coincides with three-valued stable semantics

Fundamenta Informaticae
Defeasible logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Representation results for defeasible logic

ACM Transactions on Computational Logic (TOCL)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Propositional defeasible logic has linear complexity

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.