Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence

DOI10.1016/j.artint.2018.11.003zbMath1478.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

zbMATH Keywords

complexityprobabilistic abstract argumentation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ Taking into account ``who said what in abstract argumentation: complexity results ⋮ An argumentative dialogue system for COVID-19 vaccine information ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ A general approach to reasoning with probabilities ⋮ On searching explanatory argumentation graphs

Uses Software

• ASPARTIX
• Dungine

Cites Work

• Unnamed Item
• Weighted argument systems: basic definitions, algorithms, and complexity results
• The complexity of computing the permanent
• Algorithms and complexity results for persuasive argumentation
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Graph theoretical structures in logic programs and default theories
• 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
• On efficiently estimating the probability of extensions in abstract argumentation frameworks
• World-set decompositions: Expressiveness and efficient algorithms
• Argumentation in artificial intelligence
• Computing ideal sceptical argumentation
• The computational complexity of ideal semantics
• Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
• A reasoning model based on the production of acceptable arguments
• Coherence in finite argument systems.
• 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
• Parametric properties of ideal semantics
• Probabilistic qualification of attack in abstract argumentation
• A probabilistic approach to modelling uncertain logical arguments
• 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
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty

This page was built for publication: Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence