Strategic Argumentation is NP-Complete

Thumbnail
View/Open
File version
Accepted Manuscript (AM)
Author(s)
Governatori, G
Olivieri, F
Scannapieco, S
Rotolo, A
Cristani, M
Griffith University Author(s)
Year published
2014
Metadata
Show full item record
Abstract
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.
Conference Title
21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014)
Volume
263
Publisher URI
DOI
Copyright Statement
© 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.
Subject
Computational logic and formal languages
Publication URI
Collection