Logic programming with defaults and argumentation theories

Hui Wan; Benjamin Grosof; Michael Kifer; Paul Fodor; Senlin Liang

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

Logic programming with defaults and argumentation theories

Hui Wan
, Benjamin Grosof
, Michael Kifer
, Paul Fodor
, Senlin Liang

Computer Science

Stony Brook University
Vulcan Inc.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

32 Scopus citations

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.

Original language	English
Title of host publication	Logic Programming - 25th International Conference, ICLP 2009, Proceedings
Pages	432-448
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-642-02846-5_35
State	Published - 2009
Event	25th International Conference on Logic Programming, ICLP 2009 - Pasadena, CA, United States Duration: Jul 14 2009 → Jul 17 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5649 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	25th International Conference on Logic Programming, ICLP 2009
Country/Territory	United States
City	Pasadena, CA
Period	07/14/09 → 07/17/09

Keywords

Argumentation theory
Defeasible reasoning
Well-founded models

Access to Document

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

Cite this

Wan, H., Grosof, B., Kifer, M., Fodor, P., & Liang, S. (2009). Logic programming with defaults and argumentation theories. In Logic Programming - 25th International Conference, ICLP 2009, Proceedings (pp. 432-448). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5649 LNCS). https://doi.org/10.1007/978-3-642-02846-5_35

@inproceedings{ea1ac18503f44dea8881e5d4d04bc57c,

title = "Logic programming with defaults and argumentation theories",

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 = "Argumentation theory, Defeasible reasoning, Well-founded models",

author = "Hui Wan and Benjamin Grosof and Michael Kifer and Paul Fodor and Senlin Liang",

year = "2009",

doi = "10.1007/978-3-642-02846-5\_35",

language = "English",

isbn = "3642028454",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "432--448",

booktitle = "Logic Programming - 25th International Conference, ICLP 2009, Proceedings",

note = "25th International Conference on Logic Programming, ICLP 2009 ; Conference date: 14-07-2009 Through 17-07-2009",

}

Wan, H, Grosof, B, Kifer, M, Fodor, P & Liang, S 2009, Logic programming with defaults and argumentation theories. in Logic Programming - 25th International Conference, ICLP 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5649 LNCS, pp. 432-448, 25th International Conference on Logic Programming, ICLP 2009, Pasadena, CA, United States, 07/14/09. https://doi.org/10.1007/978-3-642-02846-5_35

Logic programming with defaults and argumentation theories. / Wan, Hui; Grosof, Benjamin; Kifer, Michael et al.
Logic Programming - 25th International Conference, ICLP 2009, Proceedings. 2009. p. 432-448 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5649 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Logic programming with defaults and argumentation theories

AU - Wan, Hui

AU - Grosof, Benjamin

AU - Kifer, Michael

AU - Fodor, Paul

AU - Liang, Senlin

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Argumentation theory

KW - Defeasible reasoning

KW - Well-founded models

UR - https://www.scopus.com/pages/publications/69949124869

U2 - 10.1007/978-3-642-02846-5_35

DO - 10.1007/978-3-642-02846-5_35

M3 - Conference contribution

AN - SCOPUS:69949124869

SN - 3642028454

SN - 9783642028458

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 432

EP - 448

BT - Logic Programming - 25th International Conference, ICLP 2009, Proceedings

T2 - 25th International Conference on Logic Programming, ICLP 2009

Y2 - 14 July 2009 through 17 July 2009

ER -

Logic programming with defaults and argumentation theories

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this