TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS

DOI10.1080/01969722.2014.894854zbMath1331.68221OpenAlexW2093175891MaRDI QIDQ2790367

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

probabilistic reasoningabstract argumentationargumentation theorygrounded semanticspreferred semantics

Mathematics Subject Classification ID

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

Related Items (7)

Probabilistic Three-Valued Argumentation Frameworks ⋮ Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches ⋮ A labelling framework for probabilistic argumentation ⋮ Probabilistic abstract argumentation frameworks, a possible world view ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence

Cites Work

• Unnamed Item
• Weighted argument systems: basic definitions, algorithms, and complexity results
• Abstract argumentation systems
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• A logical account of formal argumentation
• A probabilistic approach to modelling uncertain logical arguments
• Change in Abstract Argumentation Frameworks: Adding an Argument
• Defeasible reasoning with variable degrees of justification

This page was built for publication: TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS