On efficiently estimating the probability of extensions in abstract argumentation frameworks
From MaRDI portal
Publication:899472
DOI10.1016/j.ijar.2015.11.009zbMath1344.68221OpenAlexW2262675902MaRDI QIDQ899472
Bettina Fazzinga, Francesco Parisi, Sergio Flesca
Publication date: 28 December 2015
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2015.11.009
Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (7)
On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ Forecasting with jury-based probabilistic argumentation ⋮ Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ A labelling framework for probabilistic argumentation ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms and complexity results for persuasive argumentation
- Complexity of semi-stable and stage semantics in argumentation frameworks
- A new approach for preference-based argumentation frameworks
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- Reasoning about preferences in argumentation frameworks
- Probabilistic description logic programs
- Computing ideal sceptical argumentation
- The computational complexity of ideal semantics
- Probabilistic logic programming
- The independent choice logic for modelling multiple agents under uncertainty
- A reasoning model based on the production of acceptable arguments
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Probabilistic qualification of attack in abstract argumentation
- A probabilistic approach to modelling uncertain logical arguments
- Consistency checking and querying in probabilistic databases under integrity constraints
- Modelling argument accrual with possibilistic uncertainty in a logic programming setting
- TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS
- Computing the Grounded Semantics in all the Subgraphs of an Argumentation Framework: An Empirical Evaluation
- The cf2 argumentation semantics revisited
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- Probabilistic Databases
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Probabilistic logic programming with conditional constraints
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Defeasible logic programming: an argumentative approach
- Belief Revision in Structured Probabilistic Argumentation
This page was built for publication: On efficiently estimating the probability of extensions in abstract argumentation frameworks
