Augmenting tractable fragments of abstract argumentation
From MaRDI portal
Publication:1761284
DOI10.1016/j.artint.2012.03.002zbMath1251.68225OpenAlexW2099091523MaRDI QIDQ1761284
Stefan Szeider, Sebastian Ordyniak, Wolfgang Dvořák
Publication date: 15 November 2012
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2012.03.002
computational complexityfixed-parameter tractabilityparameterized complexityabstract argumentationbackdoors
Related Items (18)
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Backdoors to Satisfaction ⋮ The complexity landscape of claim-augmented argumentation frameworks ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ Backdoor Sets for CSP. ⋮ Backdoors for linear temporal logic ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Acceptance in incomplete argumentation frameworks ⋮ Backdoors into heterogeneous classes of SAT and CSP ⋮ Parameterised complexity of model checking and satisfiability in propositional dependence logic ⋮ Strong Backdoors for Default Logic ⋮ Graph-classes of argumentation frameworks with collective attacks ⋮ A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions ⋮ Backdoors to planning ⋮ Complexity of abstract argumentation under a claim-centric view ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey ⋮ Backdoors to tractable answer set programming ⋮ Computational Short Cuts in Infinite Domain Constraint Satisfaction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the resolution-based family of abstract argumentation semantics and its grounded instance
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Finding odd cycle transversals.
- Argumentation in artificial intelligence
- Computational properties of argument systems satisfying graph-theoretic constraints
- Backdoor sets of quantified Boolean formulas
- How to reason defeasibly
- An abstract, argumentation-theoretic approach to default reasoning
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Permanents, Pfaffian orientations, and even directed circuits
- A logical account of formal argumentation
- Backdoors to tractable answer set programming
- Parametrized complexity theory.
- On the Intertranslatability of Argumentation Semantics
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- On the Issue of Reinstatement in Argumentation
- Robust semantics for argumentation frameworks
- Properties and Complexity of Some Formal Inter-agent Dialogues
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
This page was built for publication: Augmenting tractable fragments of abstract argumentation