Skip to main content
SpringerLink
Log in

Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Matic

  • Conference paper
Computational Logic in Multi-Agent Systems (CLIMA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8624))

Included in the following conference series:

Abstract

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 reasoners over networks with different topologies (including small-world ones): we scale the number of arguments to check the limits of today’s systems. Such results can be used to guide further improvements, specifically ConArg2, which we recently developed, and tested for the first time in this work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amgoud, L., Cayrol, C.: Inferring from inconsistency in preference-based argumentation frameworks. J. Autom. Reasoning 29(2), 125–169 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Amgoud, L., Devred, C.: Argumentation frameworks as constraint satisfaction problems. In: Benferhat, S., Grant, J. (eds.) SUM 2011. LNCS, vol. 6929, pp. 110–122. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  4. Bench-Capon, T.J.M.: Persuasion in practical argument using value-based argumentation frameworks. J. Log. Comput. 13(3), 429–448 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bench-Capon, T.J.M., Dunne, P.E.: Argumentation in artificial intelligence. Artif. Intell. 171(10-15), 619–641 (2007), http://dx.doi.org/10.1016/j.artint.2007.05.001

    Article  MATH  MathSciNet  Google Scholar 

  6. Bistarelli, S., Rossi, F., Santini, F.: Benchmarking hard problems in random abstract AFs: The stable semantics. In: Proceedings of the Fifth International Conference on Computational Models of Argument. FAIA. IOS Press (to appear, 2014)

    Google Scholar 

  7. Bistarelli, S., Rossi, F., Santini, F.: Comparing three abstract argumentation reasoning-tools over three graph models. In: ECAI 2014 - 21st European Conference on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications. IOS Press (to appear, 2014)

    Google Scholar 

  8. Bistarelli, S., Santini, F.: A common computational framework for semiring-based argumentation systems. In: ECAI 2010 - 19th European Conference on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 131–136. IOS Press (2010)

    Google Scholar 

  9. Bistarelli, S., Santini, F.: Conarg: A constraint-based computational framework for argumentation systems. In: Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, ICTAI 2011, pp. 605–612. IEEE Computer Society, Washington, DC (2011), http://dx.doi.org/10.1109/ICTAI.2011.96

    Chapter  Google Scholar 

  10. Bistarelli, S., Santini, F.: Modeling and solving afs with a constraint-based tool: Conarg. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS, vol. 7132, pp. 99–116. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-29184-5_7

    Chapter  Google Scholar 

  11. Bistarelli, S., Santini, F.: Coalitions of arguments: An approach with constraint programming. Fundam. Inform. 124(4), 383–401 (2013)

    MATH  MathSciNet  Google Scholar 

  12. Cerutti, F., Dunne, P.E., Giacomin, M., Vallati, M.: Computing preferred extensions in abstract argumentation: A SAT-based approach. In: Black, E., Modgil, S., Oren, N. (eds.) TAFA 2013. LNCS, vol. 8306, pp. 176–193. Springer, Heidelberg (2014)

    Google Scholar 

  13. 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), 321–357 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  14. Dunne, P.E., Hunter, A., McBurney, P., Parsons, S., Wooldridge, M.: Weighted argument systems: Basic definitions, algorithms, and complexity results. Artif. Intell. 175(2), 457–486 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  15. Dvořák, W., Morak, M., Nopp, C., Woltran, S.: dynPARTIX - A dynamic programming reasoner for abstract argumentation. In: Tompits, H., Abreu, S., Oetsch, J., Pührer, J., Seipel, D., Umeda, M., Wolf, A. (eds.) INAP/WLP 2011. LNCS (LNAI), vol. 7773, pp. 259–268. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Dvořák, W., Järvisalo, M., Wallner, J.P., Woltran, S.: Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell. 206, 53–78 (2014), http://dx.doi.org/10.1016/j.artint.2013.10.001

    Article  Google Scholar 

  17. Egly, U., Gaggl, S.A., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Argument & Computation 1(2), 147–177 (2010)

    Article  Google Scholar 

  18. Erdős, P., Rényi, A.: On the evolution of random graphs. Bull. Inst. Internat. Statist. 38(4), 343–347 (1961)

    MathSciNet  Google Scholar 

  19. Gabbriellini, S., Torroni, P.: Large scale agreements via microdebates. In: AT. CEUR Workshop Proceedings, vol. 918, pp. 366–377. CEUR-WS.org (2012)

    Google Scholar 

  20. Gabbriellini, S., Torroni, P.: Arguments in social networks. In: Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems, AAMAS 2013, pp. 1119–1120. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2013), http://dl.acm.org/citation.cfm?id=2484920.2485100

    Google Scholar 

  21. Martel, C., Nguyen, V.: Analyzing Kleinberg’s (and other) small-world models. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2004, pp. 179–188. ACM, New York (2004), http://doi.acm.org/10.1145/1011767.1011794

    Google Scholar 

  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, 635–668 (2014)

    MATH  Google Scholar 

  23. Nofal, S., Atkinson, K., Dunne, P.E.: Algorithms for decision problems in argument systems under preferred semantics. Artif. Intell. 207, 23–51 (2014)

    Article  MathSciNet  Google Scholar 

  24. Rahwan, I., Simari, G.R.: Argumentation in Artificial Intelligence, 1st edn. Springer Publishing Company, Incorporated (2009)

    Google Scholar 

  25. Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)

    Google Scholar 

  26. Toni, F., Sergot, M.: Argumentation and answer set programming. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol. 6565, pp. 164–180. Springer, Heidelberg (2011), http://dx.doi.org/10.1007/978-3-642-20832-4_11

    Chapter  Google Scholar 

  27. Toni, F., Torroni, P.: Bottom-up argumentation. In: Modgil, S., Oren, N., Toni, F. (eds.) TAFA 2011. LNCS, vol. 7132, pp. 249–262. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-29184-5_16

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Universitá of Perugia, Italy

    Stefano Bistarelli, Fabio Rossi & Francesco Santini

  2. Istituto di Informatica e Telematica (IIT-CNR), Pisa, Italy

    Stefano Bistarelli & Francesco Santini

Authors
  1. Stefano Bistarelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabio Rossi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesco Santini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Clausthal University of Technology, Adolph-Römer-Strasse 2A, 38678, Clausthal-Zellerfeld, Germany

    Nils Bulling

  2. University of Luxembourg, Campus Kirchberg, 6, rue Richard Doudenhove-Kalergi, 1359, Luxembourg, Luxembourg

    Leendert van der Torre

  3. Inria Sophia Antipolis-Méditerranée, 2004, route des Lucioles - BP 93, 06902, Sophia Antipolis, France

    Serena Villata

  4. University of Luxembourg, Computer Science and Communication Research Unit, Interdisciplinary Centre of Security, Reliability and Trust, Campus Kirchberg, 6, rue Richard Coudenhove-Kalergi, 1359, Luxembourg, Luxembourg

    Wojtek Jamroga

  5. Department of Computing Science, University of Aberdeen, Meston Building, Room 232, Old Aberdeen, AB24 3UE, Aberdeen, UK

    Wamberto Vasconcelos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bistarelli, S., Rossi, F., Santini, F. (2014). Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Matic. In: Bulling, N., van der Torre, L., Villata, S., Jamroga, W., Vasconcelos, W. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2014. Lecture Notes in Computer Science(), vol 8624. Springer, Cham. https://doi.org/10.1007/978-3-319-09764-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09764-0_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09763-3

  • Online ISBN: 978-3-319-09764-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation