Argument strength in probabilistic argumentation using confirmation theory

DOI10.1007/978-3-030-86772-0_6OpenAlexW3199852266MaRDI QIDQ2146004

Anthony Hunter

Publication date: 15 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86772-0_6

zbMATH Keywords

probabilistic argumentationdefeasible logicargument strengthdeductive argumentation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Belief revision in structured probabilistic argumentation, model and application to cyber security
• A mathematical treatment of defeasible reasoning and its implementation.
• Circumscription - a form of non-monotonic reasoning
• From fine-grained properties to broad principles for gradual argumentation: a principled spectrum
• Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• A probabilistic approach to modelling uncertain logical arguments
• A Game-Theoretic Measure of Argument Strength for Abstract Argumentation
• Argumentation Semantics for Defeasible Logic
• Defeasible logic programming: an argumentative approach
• Belief in Attacks in Epistemic Probabilistic Argumentation
• Probabilistic Reasoning with Abstract Argumentation Frameworks

This page was built for publication: Argument strength in probabilistic argumentation using confirmation theory