Toward a computational analysis of probabilistic argumentation frameworks

DOI10.1080/01969722.2014.894854MaRDI QIDQ2790367zbMATH OpenOpenAlexFDO

Authors Pierpaolo Dondio

Publication date 4 March 2016

Published in Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01969722.2014.894854

zbMATH Keywords

abstract argumentationargumentation theorygrounded semanticspreferred semanticsprobabilistic reasoning

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• On the complexity of probabilistic abstract argumentation frameworks
• Probabilities on extensions in abstract argumentation
• Probabilistic abstract dialectical frameworks
• On efficiently estimating the probability of extensions in abstract argumentation frameworks
• Probabilistic reasoning with abstract argumentation frameworks

Cites work

• A logical account of formal argumentation
• A probabilistic approach to modelling uncertain logical arguments
• A probabilistic semantics for abstract argumentation
• Abstract argumentation systems
• Change in abstract argumentation frameworks: adding an argument
• Defeasible reasoning with variable degrees of justification
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• Weighted argument systems: basic definitions, algorithms, and complexity results

Cited in

(25)

• Inference procedures and engine for probabilistic argumentation
• Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
• A probabilistic analysis of argument cogency
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
• Probabilistic abstract argumentation frameworks, a possible world view
• A polynomial-time fragment of epistemic probabilistic argumentation
• Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
• Probabilistic argumentation
• Computing the grounded semantics in all the subgraphs of an argumentation framework: an empirical evaluation
• Probabilistic abstract dialectical frameworks
• On the complexity of probabilistic abstract argumentation frameworks
• Probabilistic argumentation systems: a new perspective on the dempster-shafer theory
• Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
• scientific article; zbMATH DE number 7483831 (Why is no real title available?)
• Probabilistic Three-Valued Argumentation Frameworks
• Possible controllability of control argumentation frameworks
• scientific article; zbMATH DE number 5586122 (Why is no real title available?)
• Probabilistic reasoning with abstract argumentation frameworks
• scientific article; zbMATH DE number 6263433 (Why is no real title available?)
• Cost-bounded argumentation
• Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
• Stability of extensions in incomplete argumentation frameworks
• Temporal duration-based probabilistic argumentation frameworks
• A labelling framework for probabilistic argumentation
• On efficiently estimating the probability of extensions in abstract argumentation frameworks

This page was built for publication: Toward a computational analysis of probabilistic argumentation frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790367)