Probabilistic abstract dialectical frameworks
From MaRDI portal
Recommendations
- On the complexity of probabilistic abstract argumentation frameworks
- Probabilities on extensions in abstract argumentation
- Toward a computational analysis of probabilistic argumentation frameworks
- Probabilistic abstract argumentation frameworks, a possible world view
- scientific article; zbMATH DE number 6928628
Cites work
- A probabilistic approach to modelling uncertain logical arguments
- Admissibility in the abstract dialectical framework
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Approximating operators and semantics for abstract dialectical frameworks
- Argumentation in artificial intelligence
- Bipolarity in argumentation graphs: towards a better understanding
- scientific article; zbMATH DE number 6928628 (Why is no real title available?)
- Instantiating knowledge bases in abstract dialectical frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
Cited in
(21)- Inference procedures and engine for probabilistic argumentation
- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
- Probabilities on extensions in abstract argumentation
- A general approach to reasoning with probabilities
- Probabilistic abstract argumentation frameworks, a possible world view
- A polynomial-time fragment of epistemic probabilistic argumentation
- Epistemic graphs for representing and reasoning with positive and negative influences of arguments
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Dialectical multivalued logic and probabilistic theory
- Toward a computational analysis of probabilistic argumentation frameworks
- On the complexity of probabilistic abstract argumentation frameworks
- Open-mindedness of gradual argumentation semantics
- Formulating semantics of probabilistic argumentation by characterizing subgraphs
- Dialectical Proof Procedures for Probabilistic Abstract Argumentation
- Admissibility in Probabilistic Argumentation
- Probabilistic Three-Valued Argumentation Frameworks
- Possible controllability of control argumentation frameworks
- On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- scientific article; zbMATH DE number 7166765 (Why is no real title available?)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
This page was built for publication: Probabilistic abstract dialectical frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938525)
