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 (dis- prove) a given thesis. We show that this is an NP-complete problem.
Compliant Business Processes with Exclusive Choices from Agent Specification
OLIVIERI, FRANCESCO;CRISTANI, Matteo;
2015-01-01
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 (dis- prove) a given thesis. We show that this is an NP-complete problem.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
nicta_publication_full_7278.pdf
solo utenti autorizzati
Tipologia:
Documento in Pre-print
Licenza:
Accesso ristretto
Dimensione
585.73 kB
Formato
Adobe PDF
|
585.73 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
