Probabilistic Bipolar Abstract Argumentation Frameworks (prBAFs) are considered, and the complexity of the fundamental problem of computing extensions' probabilities is addressed. The most popular semantics of supports and extensions are considered, as well as different paradigms for defining the probabilistic encoding of the uncertainty. Interestingly, the presence of supports, which does not alter the complexity of verifying extensions in the deterministic case, is shown to introduce a new source of complexity in some probabilistic settings, for which tractable cases are also identified.

Probabilistic bipolar abstract argumentation frameworks: Complexity results

Fazzinga B.;Flesca S.;Furfaro F.
2018-01-01

Abstract

Probabilistic Bipolar Abstract Argumentation Frameworks (prBAFs) are considered, and the complexity of the fundamental problem of computing extensions' probabilities is addressed. The most popular semantics of supports and extensions are considered, as well as different paradigms for defining the probabilistic encoding of the uncertainty. Interestingly, the presence of supports, which does not alter the complexity of verifying extensions in the deterministic case, is shown to introduce a new source of complexity in some probabilistic settings, for which tractable cases are also identified.
2018
9780999241127
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/20.500.11770/311211
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 28
  • ???jsp.display-item.citation.isi??? ND
social impact