An algorithm for stage semantics
Part of book or chapter of book
- Publisher: IOS Press
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.
19 references, page 1 of 2
views in local repository
downloads in local repository
The information is available from the following content providers: