Abstract
In [4] [5], the classical acceptability semantics are generalized by preferences. The extensions under a given semantics correspond to maximal elements of a relation encoding this semantics and defined on subsets of arguments. Furthermore, a set of postulates is proposed to provide a full characterization of any relation encoding the generalized stable semantics. In this paper, we adapt this approach to preference-based argumentation frameworks with necessities. We propose a full characterization of stable and naive semantics in this new context by new sets of adapted postulates and we present a practical method to compute them by using a classical Dung argumentation framework.
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
Amgoud, L., Cayrol, C.: A reasoning model based on the production of acceptable arguments. Ann. Math. Artif. Intell. 34, 197–216 (2002)
Amgoud, L., Besnard, P.: Bridging the Gap between Abstract Argumentation Systems and Logic. In: Godo, L., Pugliese, A. (eds.) SUM 2009. LNCS, vol. 5785, pp. 12–27. Springer, Heidelberg (2009)
Amgoud, L., Vesic, S.: Repairing preference-based argumentation systems. In: Proceedings of IJCAI 2009, pp. 665–670 (2009)
Amgoud, L., Vesic, S.: Generalizing stable semantics by preferences. In: Proceedings of COMMA 2010, pp. 39–50 (2010)
Amgoud, L., Vesic, S.: A new approach for preference-based argumentation frameworks. Ann. Math. Artif. Intell. 63(2), 149–183 (2011)
Bench-Capon, T.J.M.: Persuasion in practical argument using value based argumentation frameworks. J. of Log. and Comp. 13(3), 429–448 (2003)
Besnard, P., Hunter, A.: Elements of Argumentation. The MIT Press (2008)
Boella, G., Gabbay, D.M., Van Der Torre, L., Villata, S.: Support in Abstract Argumentation. In: Proceedings of COMMA 2010, pp. 40–51 (2010)
Brewka, G., Woltran, S.: Abstract Dialectical Frameworks. In: Proceedings of KR 2010, pp. 102–111 (2010)
Cayrol, C., Lagasquie-Schiex, M.C.: On the Acceptability of Arguments in Bipolar Argumentation Frameworks. In: Godo, L. (ed.) ECSQARU 2005. LNCS (LNAI), vol. 3571, pp. 378–389. Springer, Heidelberg (2005)
Cayrol, C., Lagasquie-Schiex, M.C.: Coalitions of arguments: A tool for handling bipolar argumentation frameworks. Int. J. Intell. Syst. 25(1), 83–109 (2010)
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intel. 77(2), 321–357 (1995)
Gebser, M., Gharib, M., Mercer, R., Schaub, T.: Monotonic Answer Set Programming. J. of Log. and Comp. 19(4), 539–564 (2009)
Gorogiannis, N., Hunter, A.: Instantiating abstract, argumentation with classical logic arguments: Postulates and properties. Artif. Intel. 175, 1479–1497 (2011)
Łukaszewicz, W.: Considerations on Default Logic: An Alternative Approach. Comput. Intel. 4, 1–16 (1988)
Modgil, S.: Reasoning about preferences in argumentation frameworks. Artif. Intel. 173, 901–934 (2009)
Nouioua, F., Risch, V.: Argumentation Frameworks with Necessities. In: Benferhat, S., Grant, J. (eds.) SUM 2011. LNCS, vol. 6929, pp. 163–176. Springer, Heidelberg (2011)
Nouioua, F., Risch, V.: A Reconstruction of Abstract Argumentation Admissible Semantics into Defaults and Answer Sets Programming. In: Proceedings of ICAART 2012, pp. 237–242 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nouioua, F. (2012). Generalizing Naive and Stable Semantics in Argumentation Frameworks with Necessities and Preferences. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds) Scalable Uncertainty Management. SUM 2012. Lecture Notes in Computer Science(), vol 7520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33362-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-33362-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33361-3
Online ISBN: 978-3-642-33362-0
eBook Packages: Computer ScienceComputer Science (R0)