Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving

Linsbichler, Thomas; Maratea, Marco; Niskanen, Andreas; Wallner, Johannes; Woltran, Stefan

doi:10.24963/ijcai.2018/263

Datensatz Zitierlink:

http://hdl.handle.net/20.500.12708/825

Titel:

Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving

Zitat:

Linsbichler, T., Maratea, M., Niskanen, A., Wallner, J., & Woltran, S. (2018). Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving. In J. Lang (Ed.), Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence : Stockholm, 13-19 July 2018. ijcai.org. https://doi.org/10.24963/ijcai.2018/263

CatalogPlus:

AC15603451

Verlags-DOI:

10.24963/ijcai.2018/263

Publikationstyp:

Konferenzbeitrag - Full-Paper Contribution

Sprache:

Englisch

Autor_innen:

Linsbichler, Thomas
Maratea, Marco
Niskanen, Andreas
Wallner, Johannes
Woltran, Stefan

Organisationseinheit:

E192 - Institut für Logic and Computation

Erschienen in:

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence : Stockholm, 13-19 July 2018

ISBN:

9780999241127

Datum (veröffentlicht):

2018

Veranstaltungsname:

Twenty-Seventh International Joint Conference on Artificial Intelligence 2018

Veranstaltungszeitraum:

13-Jul-2018 - 19-Jul-2018

Veranstaltungsort:

Stockholm, Schweden

Umfang:

Verlag:

ijcai.org, Sweden, Stockholm

Peer Reviewed:

Keywords:

Computational Complexity of Reasoning; Computational Models of Argument

Abstract:

Abstract dialectical frameworks (ADFs) constitute one of the most powerful formalisms in abstract argumentation. Their high computational complexity poses, however, certain challenges when designing efficient systems. In this paper, we tackle this issue by (i) analyzing the complexity of ADFs under structural restrictions, (ii) presenting novel algorithms which make use of these insights, and (iii) empirically evaluating a resulting implementation which relies on calls to SAT solvers.

Weitere Information:

The final publication is available via <a href="https://doi.org/10.24963/ijcai.2018/263" target="_blank">https://doi.org/10.24963/ijcai.2018/263</a>.

Lizenz:

Urheberrechtsschutz

Enthalten in den Sammlungen:

Conference Paper