Expressing Extension-Based Semantics Based on Stratified Minimal Models

Authors:
Juan Carlos Nieves;Mauricio Osorio;Claudia Zepeda
Affiliations:
Software Department (LSI), Universitat Politècnica de Catalunya, Barcelona, Spain E08034;Universidad de las Américas - Puebla CENTIA, Puebla, México 72820;Facultad de Ciencias de la Computación, Puebla, Benemérita Universidad Atónoma de Puebla, Puebla, México
Venue:
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Year:
2009

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
Coherence in finite argument systems

Artificial Intelligence
Partial Evaluation and Relevance for Approximations of Stable Semantics

ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Defining new argumentation-based semantics by minimal models

ENC '06 Proceedings of the Seventh Mexican International Conference on Computer Science
Argumentation in artificial intelligence

Artificial Intelligence
Preferred extensions as stable models*

Theory and Practice of Logic Programming
Digraphs: Theory, Algorithms and Applications

Digraphs: Theory, Algorithms and Applications
SCC-recursiveness: a general schema for argumentation semantics

Artificial Intelligence

cf2 Semantics Revisited

Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory

Fundamenta Informaticae - Logic, Language, Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extension-based argumentation semantics is a successful approach for performing non-monotonic reasoning based on argumentation theory. An interesting property of some extension-based argumentation semantics is that these semantics can be characterized in terms of logic programming semantics. In this paper, we present novel results in this topic. In particular, we show that one can induce an argumentation semantics (that we call Stratified Argumentation Semantics) based on a logic programming semantics that is based on stratified minimal models. We show that the stratified argumentation semantics overcome some problems of extension-based argumentation semantics based on admissible sets and we show that it coincides with the argumentation semantics CF2.