Strategic Argumentation is NP-Complete

Governatori, Guido; Olivieri, Francesco; Scannapieco, Simone; Rotolo, Antonino; Cristani, Matteo

doi:10.3233/978-1-61499-419-0-399

View/Open

102971_1.pdf (215.9Kb)

Author

Year published

2014

Metadata

Show full item record

Abstract

We study the complexity of the Strategic Argumentation Problem for 2-player dialogue games where a player should decide what move (set of rules) to play at each turn in order to prove (disprove) a given thesis. We show that this is an NP-complete problem.

Conference Title

Frontiers in Artificial Intelligence and Applications

Publisher URI

http://www.ecai2014.org/

DOI

https://doi.org/10.3233/978-1-61499-419-0-399

Copyright Statement

© 2014 The Authors and IOS Press. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the publisher website for access to the definitive, published version.

Subject

Computational Logic and Formal Languages

Publication URI

http://hdl.handle.net/10072/68366

Collection

Conference outputs