Computing argumentation in logic programming (1999) [46 citations — 9 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Kakas99computingargumentation,author = {Antonios C. Kakas and Francesca Toni},
title = {Computing argumentation in logic programming},
journal = {Journal of Logic and Computation},
year = {1999},
volume = {9},
pages = {515--562}
}
Years of Citing Articles
Abstract:
In recent years, argumentation has been shown to be an appropriate framework in which logic programming with negation as failure as well as other logics for non-monotonic reasoning can be encompassed. Many of the existing semantics for negation as failure in logic programming can be understood in a uniform way using argumentation. Moreover, other logics for non-monotonic reasoning that can also be formulated via argumentation can be given new semantics, by a direct extension of the logic programming semantics. In this paper we develop an abstract computational framework where various argumentation semantics can be computed via dierent parametric variations of a simple basic proof theory. This proof theory is given in terms of derivations of trees where each node in a tree contains an argument (or attack) against its corresponding parent node. The proposed proof theory, dened here for the case of logic programming, generalises directly to other logics for non-monotonic reasoning that can also be formalised via argumentation. The abstract proof theory forms the basis for developing concrete top-down proof procedures for query evaluation. These proof procedures are obtained by adopting specic search strategies and ways of computing attacks in the particular argumentation framework. For logic programming these procedures can be seen as a generalisation of the Eshghi-Kowalski abductive proof procedure that in turn generalises SLDNF.
Citations
| 359 | On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games – Dung - 1995 |
| 29 | Stable theories for logic programs – Kakas, Mancarella - 1991 |
| 12 | Computing the acceptability semantics – Toni, Kakas - 1995 |
| 6 | Loop checking and the well-founded semantics – Lifschitz, McCain, et al. - 1995 |
| 1 | Foundations of deductive databases and logic programming – Aravindan, Dung - 1988 |
| 1 | 9] M. Denecker, D. De Schreye. SLDNFA: An abductive proof procedure for abductive logic programming – Dimopoulos, Kakas - 1996 |
| 1 | An extended abductive framework for negation – Kakas, Mancarella - 1998 |
| 1 | Derivation procedures for extended stable models – icio - 1991 |
| 1 | Well-founded and Stationary Models of Logic Programs – Przymusinsky |
| 1 | Semantics of disjunctive logic programs and deductive databases – Przymusinsky - 1991 |
