Journal of Logic and Computation, Volume 9, Issue 4, pp. 515562: Abstract.
Computing argumentation in logic programmingKC Kakas^{1} and F Toni^{2} ^{1}Department of Computer Science, University of Cyprus, 75 Kallipoleos Street, Nicosia, PO Box 537, Cyprus, Email: antonis@turing.cs.ucy.ac.cy, ^{2}Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, London SW7 2BZ, UK, Email: ft@doc.ic.ac.uk
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 nonmonotonic 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 nonmonotonic 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 different 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, defined here for the case of logic programming, generalizes directly to other logics for nonmonotonic reasoning that can also be formalized via argumentation. The abstract proof theory forms the basis for developing concrete topdown proof procedures for query evaluation. These proof procedures are obtained by adopting specific search strategies and ways of computing attacks in the particular argumentation framework. For logic programming these procedures can be seen as a generalization of the EshghiKowalski abductive proof procedure that in turn generalizes SLDNF. Keywords: Logic programming, negation as failure, argumentation, nonmonotonic reasoning, default reasoning.
