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

Record link:

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

Title:

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

Citation:

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

Publisher DOI:

10.24963/ijcai.2018/263

Publication Type:

Inproceedings - Full-Paper Contribution

Language:

English

Authors:

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

Organisational Unit:

E192 - Institut für Logic and Computation

Published in:

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

ISBN:

9780999241127

Date (published):

2018

Event name:

Twenty-Seventh International Joint Conference on Artificial Intelligence 2018

Event date:

13-Jul-2018 - 19-Jul-2018

Event place:

Stockholm, Sweden

Number of Pages:

Publisher:

ijcai.org, Sweden, Stockholm

Peer reviewed:

Yes

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.

Additional 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>.

License:

In Copyright

Appears in Collections:

Conference Paper