Abstract
The semi-stable semantics for formal argumentation has been introduced as a way of approximating stable semantics in situations where no stable extensions exist. Semi-stable semantics can be located between stable semantics and preferred semantics in the sense that every stable extension is a semi-stable extension and every semi-stable extension is a preferred extension. Moreover, in situations where at least one stable extension exists, the semi-stable extensions are equal to the stable extensions. In this paper we provide an outline of an algorithm for computing the semi-stable extensions, given an argumentation framework. We show that with a few modifications, the algorithm can also be used for computing stable and preferred semantics.
This work was sponsored by the Netherlands Organization for Scientific Research (NWO). We also thank Newres al Haider for helping to develop the initial idea.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Vreeswijk, G.: An algorithm to compute minimally grounded and admissible defence sets in argument systems. In: Dunne, P., Bench-Capon, T. (eds.) Computational Models of Argument, Proceedings of COMMA 2006, pp. 109–120. IOS, Amsterdam (2006)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77, 321–357 (1995)
Caminada, M.: Semi-stable semantics. In: Dunne, P., Bench-Capon, T. (eds.) Computational Models of Argument, Proceedings of COMMA 2006, pp. 121–130. IOS Press, Amsterdam (2006)
Caminada, M.: An algorithm for computing semi-stable semantics. Technical Report Technical Report UU-CS-2007 -010, Utrecht University (2007), http://www.cs.uu.nl/~martinc/algorithm_techreport.pdf
Caminada, M.: On the issue of reinstatement in argumentation. In: Fisher, M., et al. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 111–123. Springer, Heidelberg (2006)
Pollock, J.L.: Cognitive Carpentry. In: A Blueprint for How to Build a Person. MIT Press, Cambridge (1995)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365–385 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caminada, M. (2007). An Algorithm for Computing Semi-stable Semantics. In: Mellouli, K. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2007. Lecture Notes in Computer Science(), vol 4724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75256-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-75256-1_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75255-4
Online ISBN: 978-3-540-75256-1
eBook Packages: Computer ScienceComputer Science (R0)