Strategic Argumentation is NP-Complete
classification
💻 cs.LO
cs.AIcs.CC
keywords
dialogueargumentationgamegamesnp-completeplayproblemstrategic
read the original abstract
In this paper we study the complexity of strategic argumentation for dialogue games. A dialogue game is a 2-player game where the parties play arguments. We show how to model dialogue games in a skeptical, non-monotonic formalism, and we show that the problem of deciding what move (set of rules) to play at each turn is an NP-complete problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.