Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
From MaRDI portal
Publication:2321260
Recommendations
- On the complexity of probabilistic abstract argumentation frameworks
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
- Probabilistic abstract dialectical frameworks
- Toward a computational analysis of probabilistic argumentation frameworks
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
Cites work
- A logic programming framework for possibilistic argumentation: Formalization and logical properties
- A new approach for preference-based argumentation frameworks
- A probabilistic approach to modelling uncertain logical arguments
- A probabilistic semantics for abstract argumentation
- A reasoning model based on the production of acceptable arguments
- Algorithms and complexity results for persuasive argumentation
- Argumentation in artificial intelligence
- Coherence in finite argument systems.
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Computing ideal sceptical argumentation
- Computing the grounded semantics in all the subgraphs of an argumentation framework: an empirical evaluation
- Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
- Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results
- Graph theoretical structures in logic programs and default theories
- Methods for solving reasoning problems in abstract argumentation -- a survey
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the complexity of probabilistic abstract argumentation frameworks
- Parametric properties of ideal semantics
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- Probabilistic qualification of attack in abstract argumentation
- Reasoning about preferences in argumentation frameworks
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The cf2 argumentation semantics revisited
- The complexity of computing the permanent
- The computational complexity of ideal semantics
- Toward a computational analysis of probabilistic argumentation frameworks
- Weighted argument systems: basic definitions, algorithms, and complexity results
- World-set decompositions: Expressiveness and efficient algorithms
Cited in
(9)- 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
- Revisiting the notions of extension and acceptance over incomplete abstract argumentation frameworks
- 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
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)
