CF2-extensions as Answer-set Models

Authors:
Mauricio Osorio;Juan Carlos Nieves;Ignasi Gómez-Sebastià
Affiliations:
CENTIA;Knowledge Engineering and Machine Learning Group;Knowledge Engineering and Machine Learning Group
Venue:
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Year:
2010

Citing 9
Cited 2

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
Computing ideal sceptical argumentation

Artificial Intelligence
On principle-based evaluation of extension-based argumentation semantics

Artificial Intelligence
Preferred extensions as stable models*

Theory and Practice of Logic Programming
Semi-Stable Semantics

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
SCC-recursiveness: a general schema for argumentation semantics

Artificial Intelligence
WizArg: Visual Argumentation Framework Solving Wizard

Proceedings of the 2010 conference on Artificial Intelligence Research and Development: Proceedings of the 13th International Conference of the Catalan Association for Artificial Intelligence
A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory

Fundamenta Informaticae - Logic, Language, Information and Computation

WizArg: Visual Argumentation Framework Solving Wizard

Proceedings of the 2010 conference on Artificial Intelligence Research and Development: Proceedings of the 13th International Conference of the Catalan Association for Artificial Intelligence
Argumentation and answer set programming

Logic programming, knowledge representation, and nonmonotonic reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. Since extension-based argumentation semantics were formalized in terms of relationships between atomic arguments, it has been shown that extension-based argumentation semantics based on admissible sets such as stable semantics can be characterized in terms of answer sets. In this paper, we present an approach for characterizing SCC-recursive semantics in terms of answer set models. In particular, we will show a characterization of CF2 in terms of answer set models. This result suggests that not only extension-based argumentation semantics based on admissible sets can be characterized in terms of answer sets; but also extension-based argumentation semantics based on Strongly Connected Components can be characterized in terms of answer sets.