Probabilistic Abstract Dialectical Frameworks
From MaRDI portal
Publication:2938525
DOI10.1007/978-3-319-11558-0_42zbMath1343.68228OpenAlexW1952013302MaRDI QIDQ2938525
Publication date: 14 January 2015
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://orca.cf.ac.uk/120620/1/probabilistic_adfs.pdf
Related Items (12)
Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs ⋮ Dialectical Proof Procedures for Probabilistic Abstract Argumentation ⋮ Inference procedures and engine for probabilistic argumentation ⋮ Admissibility in Probabilistic Argumentation ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches ⋮ Open-Mindedness of Gradual Argumentation Semantics ⋮ On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics ⋮ A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence ⋮ A general approach to reasoning with probabilities ⋮ A polynomial-time fragment of epistemic probabilistic argumentation ⋮ Epistemic graphs for representing and reasoning with positive and negative influences of arguments
Cites Work
- Unnamed Item
- Approximating operators and semantics for abstract dialectical frameworks
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Argumentation in artificial intelligence
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Bipolarity in argumentation graphs: towards a better understanding
- A probabilistic approach to modelling uncertain logical arguments
- Instantiating Knowledge Bases in Abstract Dialectical Frameworks
- Admissibility in the Abstract Dialectical Framework
This page was built for publication: Probabilistic Abstract Dialectical Frameworks