Inferring acceptable arguments with Answer Set Programming

Authors:
Mauricio Osorio;Claudia Zepeda;Juan Carlos Nieves;Ulises Cortes
Affiliations:
Universidad de las Americas - Puebla, Mexico;Universidad de las Americas - Puebla, Mexico;Universitat Politecnica de Catalunya, Spain;Universitat Politecnica de Catalunya, Spain
Venue:
ENC '05 Proceedings of the Sixth Mexican International Conference on Computer Science
Year:
2005

Citing 6
Cited 4

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
Introduction to Algorithms

Introduction to Algorithms
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Applications of intuitionistic logic in Answer Set Programming

Theory and Practice of Logic Programming
Preferred arguments are harder to compute than stable extensions

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

Manifold Answer-Set Programs for Meta-reasoning

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
cf2 Semantics Revisited

Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Manifold answer-set programs and their applications

Logic programming, knowledge representation, and nonmonotonic reasoning
Argumentation-based framework for industrial wastewater discharges management

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in an agent-based platform called CARREL. It is an agent-agency which mediates organ transplants. We present two possible ways to infer the stable and preferred extensions of an argumentation framework, one in a declarative way using Answer Set Programming( ASP) and the other one in a procedure way.