Strategic Argumentation Under Grounded Semantics is NP-Complete

View/Open
File version
Accepted Manuscript (AM)
Author(s)
Governatori, Guido
Maher, Michael J
Olivieri, Francesco
Rotolo, Antonino
Scannapieco, Simone
Griffith University Author(s)
Year published
2015
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 to play at each turn in order to prove (disprove) a given claim. We shall prove that this is an NP-complete problem. The result covers one the most popular argumentation semantics proposed by Dung [4]: the grounded semantics.
Conference Title
Lecture Notes in Computer Science
Volume
8953
DOI
Copyright Statement
© Springer International Publishing Switzerland 2015. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher.The original publication is available at www.springerlink.com
Subject
Theory of computation
Science & Technology
Computer Science, Artificial Intelligence
Computer Science, Information Systems
Robotics
Publication URI
Collection