A general schema for generating argumentation semantics from logic programming semantics

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/87623

Title:	A general schema for generating argumentation semantics from logic programming semantics
Author:	Nieves Sánchez, Juan Carlos; Osorio Galindo, Mauricio
Other authors:	Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
Abstract:	In this paper, by considering the idea that argumentation semantics can be viewed as a special form of logic programming semantics with negation as failure, we show that any logic programming semantics as the stable model semantics, the minimal models, etc., can define candidate argumentation semantics. These new argumentation semantics will overcome some of the problems of the Dung's argumentation semantics that have been discussed in the literature. The new argumentation semantics are based on a new recursive framework for logic programming semantics. This framework generalizes any logic programming semantics in order to build logic programming semantics which are always defined, satisfy the property of relevance and agree with the stable semantics for the class of stratified programs.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial -Argumentation semantics -Logic programming -Non-monotonic reasoning
Rights:
Document type:	Article - Published version Report
Share: