Logic Programming with Defaults and Argumentation Theories

We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We present a model-theoretic semantics and study its reducibility and well-behavior properties. We use the framework as an elegant and flexible foundation to extend and improve upon Generalized Courteous Logic Programs (GCLP) [19]--one of the popular forms of defeasible reasoning. The extensions include higherorder and object-oriented features of Hilog and F-Logic [7,21]. The improvements include much simpler, incremental reasoning algorithms and more intuitive behavior. The framework and its Courteous family instantiation were implemented as an extension to the FLORA-2 system.

• Type: Conference
• Year: 2009
• Where: ICLP
• Authors: Hui Wan, Benjamin N. Grosof, Michael Kifer, Paul Fodor, Senlin Liang
• Keywords: Courteous Logic Programs, Defeasible Reasoning, ICLP 2009, Incremental Reasoning Algorithms, Programming Languages