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
Computational Logic and Formal Languages