Pages that link to "Item:Q2938525"

The following pages link to Probabilistic Abstract Dialectical Frameworks (Q2938525):

Displaying 14 items.

• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
• Inference procedures and engine for probabilistic argumentation (Q1678421) (← links)
• Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches (Q1726415) (← links)
• A general approach to reasoning with probabilities (Q2283285) (← links)
• A polynomial-time fragment of epistemic probabilistic argumentation (Q2302822) (← links)
• Epistemic graphs for representing and reasoning with positive and negative influences of arguments (Q2303513) (← links)
• Dialectical multivalued logic and probabilistic theory (Q2358241) (← links)
• Open-Mindedness of Gradual Argumentation Semantics (Q3297812) (← links)
• Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs (Q3457708) (← links)
• Dialectical Proof Procedures for Probabilistic Abstract Argumentation (Q4571152) (← links)
• Admissibility in Probabilistic Argumentation (Q5094045) (← links)
• On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics (Q5145833) (← links)
• A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence (Q5172603) (← links)
• (Q5215674) (← links)