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

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.
978-3-319-25523-1
Reasoning
Artificial Intelligence
Logic
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/954858
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 8
social impact