Skip Navigation

Journal of Logic and Computation 1999 9(4):515-562; doi:10.1093/logcom/9.4.515
© 1999 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kakas, K.
Right arrow Articles by Toni, F
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Computing argumentation in logic programming

KC KakasA1 and F ToniA2

A1 Department of Computer Science, University of Cyprus, 75 Kallipoleos Street, Nicosia, PO Box 537, Cyprus E-mail: antonis@turing.cs.ucy.ac.cy A2 Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen's Gate, London SW7 2BZ, UK E-mail: 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 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 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 non-monotonic reasoning that can also be formalized 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 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 Eshghi-Kowalski abductive proof procedure that in turn generalizes SLDNF.

Keywords: Logic programming, negation as failure, argumentation, non-monotonic reasoning, default reasoning.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
P. M. Thang, P. M. Dung, and N. D. Hung
Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation
J Logic Computation, June 26, 2009; (2009) exp032v1.
[Abstract] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.