Logic Programming with Defaults and Argumentation Theories

  • Authors:
  • Hui Wan;Benjamin Grosof;Michael Kifer;Paul Fodor;Senlin Liang

  • Affiliations:
  • State University of New York at Stony Brook, USA;Vulcan, Inc., USA;State University of New York at Stony Brook, USA;State University of New York at Stony Brook, USA;State University of New York at Stony Brook, USA

  • Venue:
  • ICLP '09 Proceedings of the 25th International Conference on Logic Programming
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 higher-order 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.