Abstract
The computation of preferred labellings of an abstract argumentation framework (or briefly, AF) is generally intractable. The existing decomposition-based approach by exploiting strongly connected components (SCCs) of a general AF is promising to cope with this problem. However, the efficiency of this approach is highly limited by the maximal SCC of an AF. This paper presents a further solution by exploiting the most sceptically rejected arguments of an AF. Given an AF, its grounded labelling is first generated. Then, the attacks between the undecided arguments and the rejected arguments are removed. It turns out that the modified AF has the same preferred labellings as the original AF, but the maximal SCC in it could be much smaller than that of the original AF. Empirical results show that this new method dramatically reduces the computation time for some sparse AFs (for instance, when the ratio of the number of edges to the number of nodes of an AF is between 1:1 and 1.8:1).
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
Dunne, P.E.: Computational properties of argument systems satisfying graph-theoretic constraints. Artificial Intelligence 171, 701–729 (2007)
Dvorák, W., Pichler, R., Woltran, S.: Towards fixed-parameter tractable algorithms for abstract argumentation. Artificial Intelligence 186, 1–37 (2012)
Dvorák, W., Szeider, S., Woltran, S.: Reasoning in argumentation frameworks of bounded clique-width. In: Proceedings of the 3th International Conference on Computational Models of Argument, Desenzano del Garda, Italy, pp. 219–230. IOS Press (September 2010)
Dvořák, W., Ja̋rvisalo, M., Wallner, J.P., Woltran, S.: Complexity-sensitive decision procedures for abstract argumentation. In: Proceedings of the KR 2012, pp. 54–64. AAAI Press (2012)
Nofal, S., Dunne, P.E., Atkinson, K.: On preferred extension enumeration in abstract argumentation. In: Proceedings of the 4th International Conference on Computational Models of Argument, Vienna, Austria, pp. 205–216. IOS Press (September 2012)
Baroni, P., Giacomin, M., Guida, G.: Scc-recursiveness: a general schema for argumentation semantics. Artificial Intelligence 168, 162–210 (2005)
Baumann, R., Brewka, G., Wong, R.: Splitting argumentation frameworks: An empirical evaluation. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS (LNAI), vol. 7132, pp. 17–31. Springer, Heidelberg (2012)
Modgil, S., Caminada, M.: Proof theories and algorithms for abstract argumentation frameworks. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 105–129. Springer (2009)
Liao, B., Jin, L., Koons, R.C.: Dynamics of argumentation systems: A division-based method. Artificial Intelligence 175(11), 1790–1814 (2011)
Liao, B., Huang, H.: Partial semantics of argumentation: Basic properties and empirical results. Journal of Logic and Computation 23(3), 541–562 (2013)
Liao, B., Huang, H.: Computing the extensions of an argumentation framework based on its strongly connected components. In: Proceedings of the 24th IEEE International Conference on Tools with Artificial Intelligence, Athens, Greece (September 2012)
Liao, B.: Toward incremental computation of argumentation semantics: A decomposition-based approach. Annals of Mathematics and Artificial Intelligence 67, 319–358 (2013)
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)
Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. The Knowledge Engineering Review 26(4), 365–410 (2011)
Caminada, M.: On the issue of reinstatement in argumentation. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 111–123. Springer, Heidelberg (2006)
Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1, 146–160 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liao, B., Lei, L., Dai, J. (2014). Computing Preferred Labellings by Exploiting SCCs and Most Sceptically Rejected Arguments. In: Black, E., Modgil, S., Oren, N. (eds) Theory and Applications of Formal Argumentation. TAFA 2013. Lecture Notes in Computer Science(), vol 8306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54373-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-54373-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54372-2
Online ISBN: 978-3-642-54373-9
eBook Packages: Computer ScienceComputer Science (R0)