Admissibility in Probabilistic Argumentation
From MaRDI portal
Publication:5094045
Recommendations
Cites work
- scientific article; zbMATH DE number 3514748 (Why is no real title available?)
- A logical account of formal argumentation
- A polynomial-time fragment of epistemic probabilistic argumentation
- A probabilistic approach to modelling uncertain logical arguments
- A probabilistic semantics for abstract argumentation
- A reasoning model based on the production of acceptable arguments
- An extension-based approach to belief revision in abstract argumentation
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Argumentation update in YALLA (yet another logic language for argumentation)
- Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
- Corrigendum to: ``A general account of argumentation with preferences
- Epistemic graphs for representing and reasoning with positive and negative influences of arguments
- Modelling defeasible and prioritized support in bipolar argumentation
- On bipolarity in argumentation frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- On the complexity of probabilistic abstract argumentation frameworks
- On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Probabilistic abstract dialectical frameworks
- Probabilistic reasoning with abstract argumentation frameworks
- Probabilities on extensions in abstract argumentation
- Semi-stable semantics
- Weighted argument systems: basic definitions, algorithms, and complexity results
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)
