Skip to main content
SpringerLink
Log in

Heureka: A General Heuristic Backtracking Solver for Abstract Argumentation

  • Conference paper
  • First Online:
Theory and Applications of Formal Argumentation (TAFA 2017)

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

Abstract

The heureka solver is a general-purpose solver for various problems in abstract argumentation frameworks pertaining to complete, grounded, preferred and stable semantics. It is based on a backtracking approach and makes use of various heuristics to optimize the search.

– I have found it! I have found it!

– Archimedes of Syracuse (287–212 BC)

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 EPUB and 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

Notes

  1. 1.

    https://github.com/nilsgeilen/heureka.

  2. 2.

    http://www.dbai.tuwien.ac.at/iccma17.

References

  1. Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: a general schema for argumentation semantics. Artif. Intell. 168(1–2), 162–210 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Corea, C., Thimm, M.: Using matrix exponentials for abstract argumentation. In: Proceedings of the First Workshop on Systems and Applications of Formal Argumentation (SAFA 2016), pp. 10–21, September 2016

    Google Scholar 

  3. 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  MathSciNet  MATH  Google Scholar 

  4. Nofal, S., Atkinson, K., Dunne, P.E.: Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments. J. Artif. Intell. Res. 49, 635–668 (2014)

    MathSciNet  MATH  Google Scholar 

  5. Nofal, S., Atkinson, K., Dunne, P.E.: Looking-ahead in backtracking algorithms for abstract argumentation. Int. J. Approx. Reason. 78, 265–282 (2016)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Web Science and Technologies, Universität Koblenz-Landau, Koblenz, Germany

    Nils Geilen & Matthias Thimm

Authors
  1. Nils Geilen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Thimm
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matthias Thimm .

Editor information

Editors and Affiliations

  1. Department of Informatics, King's College London, London, United Kingdom

    Elizabeth Black

  2. King's College London , London, United Kingdom

    Sanjay Modgil

  3. Department of Computing Science, University of Aberdeen , Aberdeen, United Kingdom

    Nir Oren

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Geilen, N., Thimm, M. (2018). Heureka: A General Heuristic Backtracking Solver for Abstract Argumentation. 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_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75553-3_10

  • 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)

Publish with us

Policies and ethics

Search

Navigation