2013/12/16 by Guido Governatori, Governatori, Guido, Francesco Olivieri +7 · 1 citation
Computer Science · #Artificial Intelligence (cs.AI) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Semantic Web and Ontologies #cs.AI #cs.CC #cs.LO
paper · pdf · doi:10.48550/arxiv.1312.4287
arxiv created 2013/12/16 · openalex publication_date 2013/12/16 · arxiv updated 2013/12/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.