Skip to main content
Conference Proceedings

Heureka: A general heuristic backtracking solver for abstract argumentation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 10757 LNAI 143-149
DOI: 10.1007/978-3-319-75553-3_10
7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Geilen, N., & Thimm, M. (2018). Heureka: A general heuristic backtracking solver for abstract argumentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10757 LNAI, pp. 143–149). Springer Verlag. https://doi.org/10.1007/978-3-319-75553-3_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free