We study the complexity of the Strategic Argumentation Problem for 2-player dialogue games where a player should decide what move to play at each turn in order to prove (disprove) a given claim. We shall prove that this is an NP-complete problem. The result covers one the most popular argumentation semantics proposed by Dung [4]: the grounded semantics.
Governatori, G., Maher, M.J., Olivieri, F., Rotolo, A., Scannapieco, S. (2015). Strategic argumentation under grounded semantics is NP-complete. Springer Verlag [10.1007/978-3-319-17130-2_26].
Strategic argumentation under grounded semantics is NP-complete
ROTOLO, ANTONINO;
2015
Abstract
We study the complexity of the Strategic Argumentation Problem for 2-player dialogue games where a player should decide what move to play at each turn in order to prove (disprove) a given claim. We shall prove that this is an NP-complete problem. The result covers one the most popular argumentation semantics proposed by Dung [4]: the grounded semantics.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
