Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results

DOI10.1093/logcom/exx035zbMath1444.68184arXiv1608.00302OpenAlexW2485423209MaRDI QIDQ4612407

Beishui Liao, Kang Xu, Huaxin Huang

Publication date: 31 January 2019

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.00302

zbMATH Keywords

computational complexitycomputational efficiencyfixed-parameter tractabilityprobabilistic argumentationcharacterized subgraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (3)

Updating Argumentation Frameworks for Enforcing Extensions ⋮ A labelling framework for probabilistic argumentation ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence

This page was built for publication: Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results