Strategic Argumentation is NP-Complete
Logic in Computer Science
2013-12-17 v1 Artificial Intelligence
Computational Complexity
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.
Keywords
Cite
@article{arxiv.1312.4287,
title = {Strategic Argumentation is NP-Complete},
author = {Guido Governatori and Francesco Olivieri and Simone Scannapieco and Antonino Rotolo and Matteo Cristani},
journal= {arXiv preprint arXiv:1312.4287},
year = {2013}
}