Logic Programming with Defaults and Argumentation Theories

  • Hui Wan
  • Benjamin Grosof
  • Michael Kifer
  • Paul Fodor
  • Senlin Liang
Conference paper

DOI: 10.1007/978-3-642-02846-5_35

Volume 5649 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Wan H., Grosof B., Kifer M., Fodor P., Liang S. (2009) Logic Programming with Defaults and Argumentation Theories. In: Hill P.M., Warren D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg

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.

Keywords

Defeasible reasoning argumentation theory well-founded models 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hui Wan
    • 1
  • Benjamin Grosof
    • 2
  • Michael Kifer
    • 1
  • Paul Fodor
    • 1
  • Senlin Liang
    • 1
  1. 1.State University of New York at Stony BrookUSA
  2. 2.Vulcan, Inc.USA