Strategic Argumentation is NP-Complete
MetadataShow full item record
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.
Frontiers in Artificial Intelligence and Applications
© 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.
Computational Logic and Formal Languages