The computational complexity of ideal semantics
From MaRDI portal
Publication:1045987
DOI10.1016/j.artint.2009.09.001zbMath1185.68666OpenAlexW2115268056MaRDI QIDQ1045987
Publication date: 21 December 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2009.09.001
computational complexityabstract argumentation frameworksassumption-based argumentationcomputational properties of argumentation
Related Items (25)
On rejected arguments and implicit conflicts: the hidden power of argumentation semantics ⋮ Weighted argumentation for analysis of discussions in Twitter ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ On checking skeptical and ideal admissibility in abstract argumentation frameworks ⋮ Characteristics of multiple viewpoints in abstract argumentation ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ Complexity of semi-stable and stage semantics in argumentation frameworks ⋮ On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ On argumentation logic and propositional logic ⋮ Uses and computation of imprecise probabilities from statistical data and expert arguments ⋮ Towards fixed-parameter tractable algorithms for abstract argumentation ⋮ Open Problems in Abstract Argumentation ⋮ Weighted argument systems: basic definitions, algorithms, and complexity results ⋮ Design and results of the second international competition on computational models of argumentation ⋮ 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 ⋮ Complexity of abstract argumentation under a claim-centric view ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ Argument graphs and assumption-based argumentation ⋮ Domain expansion for ASP-programs with external sources
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph theoretical structures in logic programs and default theories
- Computing functions with parallel queries to NP
- Two party immediate response disputes: Properties and efficiency
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- Computational properties of argument systems satisfying graph-theoretic constraints
- Semantical considerations on nonmonotonic logic
- NP is as easy as detecting unique solutions
- On the relation between default and autoepistemic logic
- A logic for default reasoning
- A comparison of polynomial time reducibilities
- Functions computable with nonadaptive queries to NP
- An abstract, argumentation-theoretic approach to default reasoning
- Coherence in finite argument systems.
- On the computational complexity of assumption-based argumentation for default reasoning.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- On unique satisfiability and the threshold behavior of randomized reductions
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Dialectic proof procedures for assumption-based, admissible argumentation
- On the unique satisfiability problem
- Bounded Query Classes
- Complexity Results for Nonmonotonic Logics
- On computing Boolean connectives of characteristic functions
This page was built for publication: The computational complexity of ideal semantics
