On efficiently estimating the probability of extensions in abstract argumentation frameworks
From MaRDI portal
Publication:899472
DOI10.1016/J.IJAR.2015.11.009zbMATH Open1344.68221OpenAlexW2262675902MaRDI QIDQ899472FDOQ899472
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
Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing ideal sceptical argumentation
- The computational complexity of ideal semantics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Defeasible logic programming: an argumentative approach
- The independent choice logic for modelling multiple agents under uncertainty
- A probabilistic approach to modelling uncertain logical arguments
- Probabilistic argumentation systems
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- Belief Revision in Structured Probabilistic Argumentation
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- Probabilistic logic programming
- A reasoning model based on the production of acceptable arguments
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- A new approach for preference-based argumentation frameworks
- Reasoning about preferences in argumentation frameworks
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Probabilistic qualification of attack in abstract argumentation
- Probabilistic Databases
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Algorithms and complexity results for persuasive argumentation
- Probabilistic description logic programs
- Probabilistic logic programming with conditional constraints
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Modelling argument accrual with possibilistic uncertainty in a logic programming setting
- TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS
- Consistency checking and querying in probabilistic databases under integrity constraints
- Computing the Grounded Semantics in all the Subgraphs of an Argumentation Framework: An Empirical Evaluation
- The \(cf2\) argumentation semantics revisited
Cited In (7)
- How we designed winning algorithms for abstract argumentation and which insight we attained
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- A labelling framework for probabilistic argumentation
- Forecasting with jury-based probabilistic argumentation
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
Uses Software
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)
