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.
Governatori, G., Olivieri, F., Scannapieco, S., Rotolo, A., Cristani, M. (2014). Strategic Argumentation is NP-Complete. ;Nieuwe Hemweg 6B : IOS Press [10.3233/978-1-61499-419-0-399].
Strategic Argumentation is NP-Complete
ROTOLO, ANTONINO;
2014
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.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.
