2006•Unpublished venueRequires access

Inferring acceptable arguments with Answer Set Programming

María Rosa Zapatero Osorio, Claudia Zepeda, Juan Carlos Nieves, Ulises Cortés

Open publisher page 24 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 24 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Answer set programming, Argumentation theory, Argumentation framework, Computer science, Agency (philosophy), Semantics (computer science), Set (abstract data type), Logic programming

Related papers

Back to paper searchBrowse research topicsOriginal source
Inferring acceptable arguments with Answer Set Programming — Research Paper | ScholarLens