On the Complexity of Probabilistic Abstract Argumentation Frameworks
From MaRDI portal
Publication:2946762
DOI10.1145/2749463zbMath1354.68253OpenAlexW2207251955MaRDI QIDQ2946762
Sergio Flesca, Bettina Fazzinga, Francesco Parisi
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2749463
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (21)
A quantitative approach to belief revision in structured probabilistic argumentation ⋮ Formulating Semantics of Probabilistic Argumentation by Characterizing Subgraphs ⋮ Complexity of nonemptiness in control argumentation frameworks ⋮ Inference procedures and engine for probabilistic argumentation ⋮ Admissibility in Probabilistic Argumentation ⋮ Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ Taking into account ``who said what in abstract argumentation: complexity results ⋮ A definition of sceptical semantics in the constellations approach ⋮ Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches ⋮ On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ Acceptance in incomplete argumentation frameworks ⋮ An approach to characterize graded entailment of arguments through a label-based framework ⋮ Belief revision in structured probabilistic argumentation, model and application to cyber security ⋮ A labelling framework for probabilistic argumentation ⋮ A general approach to reasoning with probabilities ⋮ Epistemic graphs for representing and reasoning with positive and negative influences of arguments ⋮ A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Knowledge compilation meets database theory: compiling queries to decision diagrams
- Complexity-sensitive decision procedures for abstract argumentation
- 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
- 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
- Skepticism relations for comparing argumentation semantics
- Probabilistic description logic programs
- Argumentation in artificial intelligence
- The computational complexity of ideal semantics
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- Probabilistic logic programming
- An argumentation framework in default logic
- 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
- 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
- SCC-recursiveness: a general schema for argumentation semantics
- The cf2 argumentation semantics revisited
- Probabilistic Databases
- Semi-stable semantics
- Probabilistic logic programming with conditional constraints
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Treewidth in Verification: Local vs. Global
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
This page was built for publication: On the Complexity of Probabilistic Abstract Argumentation Frameworks
