Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
From MaRDI portal
Recommendations
- On the complexity of probabilistic abstract argumentation frameworks
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Toward a computational analysis of probabilistic argumentation frameworks
- On the computational complexity of assumption-based argumentation for default reasoning.
- Declarative algorithms and complexity results for assumption-based argumentation
Cites work
- A general account of argumentation with preferences
- A logic for default reasoning
- A probabilistic approach to modelling uncertain logical arguments
- A probabilistic semantics for abstract argumentation
- A two-phase method for extracting explanatory arguments from Bayesian networks
- Abstraction-based algorithm for 2QBF
- Agents that reason and negotiate by arguing
- An abstract, argumentation-theoretic approach to default reasoning
- An axiomatic analysis of structured argumentation with priorities
- Bipolarity in argumentation graphs: towards a better understanding
- Capturing bipolar argumentation in non-flat assumption-based argumentation
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
- Computing ideal sceptical argumentation
- Defeasible logic programming: an argumentative approach
- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
- From structured to abstract argumentation: assumption-based acceptance via AF reasoning
- Fundamental properties of attack relations in structured argumentation with priorities
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 6934384 (Why is no real title available?)
- Inference procedures and engine for probabilistic argumentation
- Instantiating abstract argumentation with classical logic arguments: postulates and properties
- Labellings for assumption-based and abstract argumentation
- Logical limits of abstract argumentation frameworks
- Negation as failure in the head
- 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
- On the computational complexity of assumption-based argumentation for default reasoning.
- On the equivalence between assumption-based argumentation and logic programming
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- Probabilistic argumentation systems. A new way to combine logic with probability.
- Probabilistic qualification of attack in abstract argumentation
- Probabilistic reasoning with abstract argumentation frameworks
- Properties and Complexity of Some Formal Inter-agent Dialogues
- Reasoning with maximal consistency by argumentative approaches
- Semantical considerations on nonmonotonic logic
- The carneades model of argument and burden of proof
- The complexity of computing the permanent
- The complexity of the warranted formula problem in propositional argumentation
- The computational complexity of ideal semantics
- Toward a more efficient generation of structured argumentation graphs
Cited in
(8)- On the computational complexity of assumption-based argumentation for default reasoning.
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Forecasting with jury-based probabilistic argumentation
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- Syntactic reasoning with conditional probabilities in deductive argumentation
- Reasoning in assumption-based argumentation using tree-decompositions
- ICCMA 2023: 5th international competition on computational models of argumentation
- Simple contrapositive assumption-based argumentation frameworks with preferences: partial orders and collective attacks
This page was built for publication: Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238615)
