An Algorithm for Stage Semantics

Authors:
Martin Caminada
Affiliations:
University of Luxembourg
Venue:
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Year:
2010

Citing 10
Cited 4

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

Artificial Intelligence
The value of the four values

Artificial Intelligence
SCC-recursiveness: a general schema for argumentation semantics

Artificial Intelligence
Computing ideal sceptical argumentation

Artificial Intelligence
An Algorithm for Computing Semi-stable Semantics

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
An Abstract Theory of Argumentation That Accommodates Defeasible Reasoning About Preferences

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Reasoning about preferences in argumentation frameworks

Artificial Intelligence
Semi-Stable Semantics

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Encompassing Attacks to Attacks in Abstract Argumentation Frameworks

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
On the issue of reinstatement in argumentation

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence

Review: an introduction to argumentation semantics

The Knowledge Engineering Review
On the complexity of probabilistic abstract argumentation

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Approximating operators and semantics for abstract dialectical frameworks

Artificial Intelligence
Algorithms for decision problems in argument systems under preferred semantics

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the current paper, we re-examine the concept of stage semantics, which is one of the oldest semantics for abstract argumentation. Using a formal treatment of its properties, we explain how the intuition behind stage semantics differs from the intuition behind the admissibility based semantics that most scholars in argumentation theory are familiar with. We then provide a labelling-based algorithm for computing all stage extensions, based on earlier algorithms for computing all preferred, stable and semi-stable extensions.