On efficiently estimating the probability of extensions in abstract argumentation frameworks
From MaRDI portal
Recommendations
- On the complexity of probabilistic abstract argumentation frameworks
- Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
- Probabilities on extensions in abstract argumentation
- A probabilistic semantics for abstract argumentation
- Formulating semantics of probabilistic argumentation by characterizing subgraphs
Cites work
- scientific article; zbMATH DE number 1285158 (Why is no real title available?)
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- A new approach for preference-based argumentation frameworks
- A probabilistic approach to modelling uncertain logical arguments
- A probabilistic semantics for abstract argumentation
- A reasoning model based on the production of acceptable arguments
- Algorithms and complexity results for persuasive argumentation
- Belief revision in structured probabilistic argumentation
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Computing ideal sceptical argumentation
- Computing the grounded semantics in all the subgraphs of an argumentation framework: an empirical evaluation
- Consistency checking and querying in probabilistic databases under integrity constraints
- Defeasible logic programming: an argumentative approach
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Modelling argument accrual with possibilistic uncertainty in a logic programming setting
- 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
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Probabilistic argumentation systems
- Probabilistic databases
- Probabilistic description logic programs
- Probabilistic logic programming
- Probabilistic logic programming with conditional constraints
- Probabilistic qualification of attack in abstract argumentation
- Reasoning about preferences in argumentation frameworks
- The cf2 argumentation semantics revisited
- The computational complexity of ideal semantics
- The independent choice logic for modelling multiple agents under uncertainty
- Toward a computational analysis of probabilistic argumentation frameworks
Cited in
(12)- How we designed winning algorithms for abstract argumentation and which insight we attained
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Probabilistic abstract argumentation frameworks, a possible world view
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- A labelling framework for probabilistic argumentation
- Probabilities on extensions in abstract argumentation
- Forecasting with jury-based probabilistic argumentation
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- Toward a computational analysis of probabilistic argumentation frameworks
- Formulating semantics of probabilistic argumentation by characterizing subgraphs
- On the complexity of probabilistic abstract argumentation frameworks
- A probabilistic semantics for abstract argumentation
This page was built for publication: On efficiently estimating the probability of extensions in abstract argumentation frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899472)
