Complexity-sensitive decision procedures for abstract argumentation
From MaRDI portal
Publication:490451
DOI10.1016/j.artint.2013.10.001zbMath1334.68206OpenAlexW2011844594MaRDI QIDQ490451
Stefan Woltran, Matti Järvisalo, Wolfgang Dvořák, Johannes Peter Wallner
Publication date: 27 August 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2013.10.001
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving, On rejected arguments and implicit conflicts: the hidden power of argumentation semantics, Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem, The first international competition on computational models of argumentation: results and analysis, On the Complexity of Probabilistic Abstract Argumentation Frameworks, Improved answer-set programming encodings for abstract argumentation, Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks, The complexity landscape of claim-augmented argumentation frameworks, Synchronous counting and computational algorithm design, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory, New stochastic local search approaches for computing preferred extensions of abstract argumentation, Acceptance in incomplete argumentation frameworks, Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks, What Is a Reasonable Argumentation Semantics?, Design and results of the second international competition on computational models of argumentation, How we designed winning algorithms for abstract argumentation and which insight we attained, Pakota: A System for Enforcement in Abstract Argumentation, Methods for solving reasoning problems in abstract argumentation -- a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Reasoning about preferences in argumentation frameworks
- Computational properties of argument systems satisfying graph-theoretic constraints
- The computational complexity of ideal semantics
- NP is as easy as detecting unique solutions
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Augmenting tractable fragments of 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
- On the computational cost of disjunctive logic programming: Propositional case
- A logical account of formal argumentation
- A QBF-based formalization of abstract argumentation semantics
- Solving QBF with Counterexample Guided Refinement
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Parameterized Splitting: A Simple Modification-Based Approach
- Splitting an Argumentation Framework
- Abstraction-Based Algorithm for 2QBF
- Complex optimization in answer set programming
- On the Intertranslatability of Argumentation Semantics
- Counterexample-guided abstraction refinement for symbolic model checking
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- On bipolarity in argumentation frameworks
- GRASP: a search algorithm for propositional satisfiability
- Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
- Theory and Applications of Satisfiability Testing
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Spectral Theory and Analysis
- Computer Aided Verification
