Abstract
This paper provides a general overview of EqArgSolver, a solver for enumeration and decision problems in argumentation theory. The solver is implemented from the ground up as a self-contained application in C++ without the use of any other external solver (e.g., SAT, ASP, CSP) or libraries.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Henceforth, these assignments will be referred to as legal assignments.
- 2.
Some filtering to eliminate solutions not leading to maximal extensions in preferred/stable semantics problems is also done, although this is not shown in Algorithm 1. For full details, refer to [7].
- 3.
The version of EqArgSolver submitted to the 2nd ICCMA did not take advantage of this simple optimisation, but since submission it has been incorporated offering a huge performance improvement in certain classes of large graphs.
References
Cerutti, F., Oren, N., Strasse, H., Thimm, M., Vallati, M.: The First International Competition on Computational Models of Argumentation (ICCMA 2015) (2015). http://argumentationcompetition.org/2015/index.html
Charwat, G., Dvořák, W., Gaggl, S.A., Wallner, J.P., Woltran, S.: Methods for solving reasoning problems in abstract argumentation - a survey. Artif. Intell. 220, 28–63 (2015)
Gabbay, D.M., Rodrigues, O.: Equilibrium states in numerical argumentation networks. Log. Univers. 9(4), 1–63 (2015)
Gabbay, D.M., Rodrigues, O.: Further applications of the Gabbay-Rodrigues iteration schema in argumentation and revision theories. In: Beierle, C., Brewka, G., Thimm, M. (eds.) Computational Models of Rationality, vol. 29, pp. 392–407. College Publications (2016)
Liao, B.: Efficient Computation of Argumentation Semantics. Academic Press, Cambridge (2014)
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, Boston (2009). https://doi.org/10.1007/978-0-387-98197-0_6
Rodrigues, O.: A forward propagation algorithm for semantic computation of argumentation frameworks. In: Black, E., et al. (eds.) TAFA 2017. LNAI, vol. 10757, pp. 120–136. Springer, Cham (2017)
Silva, J.P.M., Sakallah, K.A.: GRASP: a new search algorithm for satisfiability. In: Proceedings of the 1996 IEEE/ACM International Conference on Computer-aided Design, ICCAD 1996, pp. 220–227. IEEE Computer Society, Washington, D.C. (1996)
Thimm, M., Villata, S.: System descriptions of the 1st International Competition on Computational Models of Argumentation (ICCMA 2015). CoRR, abs/1510.05373 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Rodrigues, O. (2018). EqArgSolver – System Description. In: Black, E., Modgil, S., Oren, N. (eds) Theory and Applications of Formal Argumentation. TAFA 2017. Lecture Notes in Computer Science(), vol 10757. Springer, Cham. https://doi.org/10.1007/978-3-319-75553-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-75553-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-75552-6
Online ISBN: 978-3-319-75553-3
eBook Packages: Computer ScienceComputer Science (R0)