Admissibility in Probabilistic Argumentation

DOI10.1613/JAIR.1.13530OpenAlexW4283579494MaRDI QIDQ5094045FDOQ5094045

Authors: Nikolai Käfer, Martin Diller, Clemens Dubslaff, Sarah Alice Gaggl, Holger Hermanns, Christel Baier 

Publication date: 2 August 2022

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.13530

Recommendations

• Probabilistic argumentation
• Probabilistic argumentation systems
• Probabilistic argumentation systems and abduction
• Probabilistic reasoning with abstract argumentation frameworks
• Probabilistic argumentation: an equational approach
• Probabilistic justification logic
• Probabilistic justification logic

zbMATH Keywords

uncertaintyprobabilistic reasoning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Title not available (Why is that?)
• A probabilistic approach to modelling uncertain logical arguments
• Argumentation update in YALLA (yet another logic language for argumentation)
• On the Complexity of Probabilistic Abstract Argumentation Frameworks
• Title not available (Why is that?)
• A reasoning model based on the production of acceptable arguments
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• A logical account of formal argumentation
• Semi-stable semantics
• An extension-based approach to belief revision in abstract argumentation
• Corrigendum to: ``A general account of argumentation with preferences
• Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
• Weighted argument systems: basic definitions, algorithms, and complexity results
• On bipolarity in argumentation frameworks
• Probabilistic Reasoning with Abstract Argumentation Frameworks
• Probabilistic Abstract Dialectical Frameworks
• On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• Modelling defeasible and prioritized support in bipolar argumentation
• Probabilities on extensions in abstract argumentation
• A polynomial-time fragment of epistemic probabilistic argumentation
• Epistemic graphs for representing and reasoning with positive and negative influences of arguments

Cited In (1)

• Syntactic reasoning with conditional probabilities in deductive argumentation

Uses Software

• SMT-LIB
• CVXOPT
• z3
• PySMT

This page was built for publication: Admissibility in Probabilistic Argumentation

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