Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
DOI10.1016/J.ARTINT.2018.11.003zbMATH Open1478.68352OpenAlexW2900754604WikidataQ128934466 ScholiaQ128934466MaRDI QIDQ2321260
Filippo Furfaro, Bettina Fazzinga, Sergio Flesca
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2018.11.003
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- Argumentation in artificial intelligence
- 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
- The complexity of computing the permanent
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- A probabilistic approach to modelling uncertain logical arguments
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- 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
- Coherence in finite argument systems.
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Algorithms and complexity results for persuasive argumentation
- World-set decompositions: Expressiveness and efficient algorithms
- Weighted argument systems: basic definitions, algorithms, and complexity results
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS
- Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- Computing the Grounded Semantics in all the Subgraphs of an Argumentation Framework: An Empirical Evaluation
- The \(cf2\) argumentation semantics revisited
- Parametric properties of ideal semantics
Cited In (8)
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Taking into account ``who said what in abstract argumentation: complexity results
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- On searching explanatory argumentation graphs
- Complexity-sensitive decision procedures for abstract argumentation
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
- A general approach to reasoning with probabilities
- An argumentative dialogue system for COVID-19 vaccine information
Uses Software
This page was built for publication: Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321260)
