×

An algorithm for computing semi-stable semantics. (English) Zbl 1148.68502

Mellouli, Khaled (ed.), Symbolic and quantitative approaches to reasoning with uncertainty. 9th European conference, ECSQARU 2007, Hammamet, Tunisia, October 31–November 2, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75255-4/pbk). Lecture Notes in Computer Science 4724. Lecture Notes in Artificial Intelligence, 222-234 (2007).
Summary: 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.
For the entire collection see [Zbl 1143.68010].

MSC:

68T37 Reasoning under uncertainty in the context of artificial intelligence
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] 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)
[2] 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) · Zbl 1013.68556 · doi:10.1016/0004-3702(94)00041-X
[3] 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)
[4] 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 · Zbl 1148.68502
[5] 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) · Zbl 1152.68600 · doi:10.1007/11853886_11
[6] Pollock, J.L.: Cognitive Carpentry. In: A Blueprint for How to Build a Person. MIT Press, Cambridge (1995)
[7] Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365–385 (1991) · Zbl 0735.68012 · doi:10.1007/BF03037169
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.