A Comparative Test on the Enumeration of Extensions in Abstract Argumentation

• Autorzy: Bistarelli S. , Rossi F. , Santini F.

Identyfikatory

DOI

10.3233/FI-2015-1254

• Konferencja: Italian Conference on Computational Logic, CILC 2013, (25-27.09.2013; Catania, Italy)
• Języki publikacji: EN

Abstrakty

EN

We compare four different implementations of reasoning-tools dedicated to Abstract Argumentation Frameworks. These systems are ArgTools, ASPARTIX, ConArg2, and Dung-O-Matic. They have been tested over three different models of randomly-generated graph models, corresponding to the Erdös-Rényi model, the Kleinberg small-world model, and the scale-free Barabasi-Albert model. This first comparison is useful to study the behaviour of these tools over networks with different topologies (also small-world): we scale the number of arguments to check the limits of today’s systems. Such results can be used to guide further improvements of ConArg2 (our tool), but also different tools.

Słowa kluczowe

EN

combinatorial enumeration problems; group extensions; mathematical models; comparative studies; abstract algebra

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2015
• Tom: Vol. 140, nr 3/4
• Strony: 263--278
• Opis fizyczny: Bibliogr. 26 poz., rys., tab.

Twórcy

autor

Bistarelli S.

• Dipartimento di Matematica e Informatica Via Vanvitelli 1, 06123 Perugia, Italy

autor

Rossi F.

• Dipartimento di Matematica e Informatica Via Vanvitelli 1, 06123 Perugia, Italy

autor

Santini F.

• Dipartimento di Matematica e Informatica Via Vanvitelli 1, 06123 Perugia, Italy

Bibliografia

• [1] Amgoud, L., Cayrol, C.: Inferring from Inconsistency in Preference-Based Argumentation Frameworks, J. Autom. Reasoning, 29(2), 2002, 125–169.
• [2] Barabasi, A. L., Albert, R.: Emergence of Scaling in Random Networks, Science, 286(5439), 1999, 509–512.
• [3] Bench-Capon, T. J. M.: Persuasion in Practical Argument Using Value-based Argumentation Frameworks, J. Log. Comput., 13(3), 2003, 429–448.
• [4] Bench-Capon, T. J. M., Dunne, P. E.: Argumentation in Artificial Intelligence, Artif. Intell., 171(10-15), July 2007, 619–641, ISSN 0004-3702.
• [5] Bistarelli, S., Rossi, F., Santini, F.: A First Comparison of Abstract Argumentation Systems: A Computational Perspective, CILC, 1068, CEUR-WS.org, 2013, 241-245.
• [6] Bistarelli, S., Rossi, F., Santini, F.: Benchmarking Hard Problems in Random Abstract AFs: The Stable Semantics, Computational Models of Argument - Proceedings of COMMA, Frontiers in Artificial Intelligence and Applications, 266, IOS Press, 2014, ISBN 978-1-61499-435-0, 153-160.
• [7] Bistarelli, S., Rossi, F., Santini, F.: Efficient Solution for Credulous/Sceptical Acceptance in Lower-Order Dungs Semantics, 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI, IEEE Computer Society, 2014, ISBN 978-1-4799-6572-4, 800-804.
• [8] Bistarelli, S., Rossi, F., Santini, F.: A First Comparison of Abstract Argumentation Reasoning-Tools, ECAI 2014 - 21st European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, 263, IOS Press, 2014, ISBN 978-1-61499-418-3, 969-970.
• [9] Bistarelli, S., Santini, F.: A Common Computational Framework for Semiring-based Argumentation Systems, ECAI 2010 - 19th European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, 215, IOS Press, 2010, ISBN 978-1-60750-605-8, 131-136.
• [10] Bistarelli, S., Santini, F.: ConArg: A Constraint-Based Computational Framework for Argumentation Systems, Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, ICTAI11, IEEE Computer Society, 2011, ISBN 978-0-7695-4596-7, 605-612.
• [11] Bistarelli, S., Santini, F.: Modeling and Solving AFs with a Constraint-Based Tool: ConArg, in: Theory and Applications of Formal Argumentation, vol. 7132 of LNCS, Springer Berlin Heidelberg, 2012, ISBN 978-3-642-29183-8, 99–116.
• [12] Bistarelli, S., Santini, F.: Coalitions of Arguments: An Approach with Constraint Programming, Fundam. Inform., 124(4), 2013, 383–401.
• [13] Charwat, G., Dvor´ak, W., Gaggl, S. A., Wallner, J. P., Woltran, S.: Methods for solving reasoning problems in abstract argumentation - A survey, Artif. Intell., 220, 2015, 28–63.
• [14] Dung, P. M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games, Artif. Intell., 77(2), 1995, 321–357, ISSN 0004-3702.
• [15] Dvŏrák, W., Morak, M., Nopp, C., Woltran, S.: dynPARTIX-A dynamic programming reasoner for abstract argumentation, in: Applications of Declarative Programming and Knowledge Management, Springer, 2013, 259–268.
• [16] Dvŏrák,W., Järvisalo, M.,Wallner, J. P.,Woltran, S.: Complexity-sensitive Decision Procedures for Abstract Argumentation, Artif. Intell., 206, January 2014, 53–78, ISSN 0004-3702.
• [17] Egly, U., Gaggl, S. A., Woltran, S.: Answer-set programming encodings for argumentation frameworks, Argument & Computation, 1(2), 2010, 147–177.
• [18] Erdös, P., Rényi, A.: On the evolution of random graphs, Bull. Inst. Internat. Statist, 38(4), 1961, 343–347.
• [19] Gabbriellini, S., Torroni, P.: Large Scale Agreements via Microdebates, Agreement Technologies, 918, CEUR-WS.org, 2012.
• [20] Gabbriellini, S., Torroni, P.: Arguments in Social Networks, Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems, AAMAS ’13, International Foundation for Autonomous Agents and Multiagent Systems, 2013, ISBN 978-1-4503-1993-5.
• [21] Martel, C., Nguyen, V.: Analyzing Kleinberg’s (and other) small-world Models, Proceedings of the ACM symposium on principles of distributed computing, PODC ’04, ACM, 2004, ISBN 1-58113-802-4.
• [22] Nofal, S., Atkinson, K., Dunne, P. E.: Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments, Journal of Artificial Intelligence Research, 49, 2014, 635–668.
• [23] Rahwan, I., Simari, G. R.: Argumentation in Artificial Intelligence, 1st edition, Springer Publishing Company, Incorporated, 2009, ISBN 0387981969, 9780387981963.
• [24] Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence), Elsevier Science Inc., 2006, ISBN 0444527265.
• [25] Toni, F., Sergot, M.: Argumentation and Answer Set Programming, in: Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, vol. 6565 of LNCS, Springer Berlin Heidelberg, 2011, ISBN 978-3-642-20831-7, 164–180.
• [26] Toni, F., Torroni, P.: Bottom-Up Argumentation, in: Theory and Applications of Formal Argumentation, vol. 7132 of LNCS, Springer Berlin Heidelberg, 2012, ISBN 978-3-642-29183-8, 249–262.