Complexity of fundamental problems in probabilistic abstract argumentation: Beyond independence (extended abstract)

The complexity of the probabilistic counterparts of the verification and acceptance problems is investigated over probabilistic Abstract Argumentation Frameworks (prAAFs), in a setting more general than the literature, where the complexity has been characterized only under independence between arguments/defeats. The complexity of these problems is shown to depend on the semantics of the extensions, the way of encoding the prAAF, and the correlations between arguments/defeats. In this regard, in order to study the impact of different correlations between arguments/defeats on the complexity, a new form of prAAF is introduced, called GEN. It is based on the well-known paradigm of world-set sets, and it allows the correlations to be easily distinguishable.



Titolo: Complexity of fundamental problems in probabilistic abstract argumentation: Beyond independence (extended abstract)
Autori: 
FAZZINGA, Bettina
FLESCA, Sergio
FURFARO, Filippo
Data di pubblicazione: 2019
Rivista: 
IJCAI  
Handle: http://hdl.handle.net/20.500.11770/303947
Appare nelle tipologie:4.1 Contributo in Atti di convegno

File in questo prodotto:
Non ci sono file associati a questo prodotto.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/20.500.11770/303947
  • Citazioni
  • PubMed Central ND
  • Scopus
  • WOS ND

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
 
 
 
Powered by IRIS-about IRIS-Utilizzo dei cookie
Logo CINECA  Copyright © 2021