论文信息 - Formalizing Defeasible Logic in CAKE

Formalizing Defeasible Logic in CAKE

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.

Witold Lukaszewicz | Ewa Madalinska-Bugaj

[1] Donald Nute,et al. Defeasible reasoning and decision support systems , 1988, Decis. Support Syst..

[2] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[3] Michael J. Maher. Under consideration for publication in Theory and Practice of Logic Programming 1 Propositional Defeasible Logic has Linear Complexity , 2004 .

[4] David Harel,et al. Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[5] Jack Minker. Foundations of deductive databases and logic programming , 1988 .

[6] Serge Abiteboul,et al. Foundations of Databases , 1994 .

[7] Teodor C. Przymusinski. The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[8] Patrick Doherty,et al. CAKE: A Computer-Aided Knowledge Engineering Technique , 2002, ECAI.

[9] David Billington,et al. Defeasible Logic is Stable , 1993, J. Log. Comput..

[10] Donald Nute,et al. Defeasible Logic , 1994, INAP.

[11] Dov M. Gabbay,et al. Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning , 1994 .

[12] Michael J. Maher,et al. Representation results for defeasible logic , 2000, TOCL.

[13] Alan van Gelser. Negation as failure using tight derivations for general logic programs , 1989 .