Complexity-sensitive decision procedures for abstract argumentation
From MaRDI portal
Publication:490451
DOI10.1016/J.ARTINT.2013.10.001zbMATH Open1334.68206OpenAlexW2011844594MaRDI QIDQ490451FDOQ490451
Stefan Woltran, Matti Järvisalo, Wolfgang Dvořák, Johannes 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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- The computational complexity of ideal semantics
- 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
- Solving QBF with Counterexample Guided Refinement
- Abstraction-Based Algorithm for 2QBF
- Counterexample-guided abstraction refinement for symbolic model checking
- Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
- Spectral Theory and Analysis
- GRASP: a search algorithm for propositional satisfiability
- NP is as easy as detecting unique solutions
- Reasoning about preferences in argumentation frameworks
- Computational properties of argument systems satisfying graph-theoretic constraints
- A logical account of formal argumentation
- Coherence in finite argument systems.
- Splitting an Argumentation Framework
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Computer Aided Verification
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Parameterized Splitting: A Simple Modification-Based Approach
- On the Intertranslatability of Argumentation Semantics
- Augmenting tractable fragments of abstract argumentation
- A QBF-based formalization of abstract argumentation semantics
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Complex optimization in answer set programming
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- On bipolarity in argumentation frameworks
Cited In (25)
- 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
- Automated Reasoning
- Nested Argumentation and Its Application to Decision Making over Actions
- What Is a Reasonable Argumentation Semantics?
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Complexity Classifications for Logic-Based Argumentation
- Acceptance in incomplete argumentation frameworks
- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- Complexity of nonemptiness in control argumentation frameworks
- The complexity landscape of claim-augmented argumentation frameworks
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- Synchronous counting and computational algorithm design
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation
- Logics in Artificial Intelligence
- Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks
- Pakota: A System for Enforcement in Abstract Argumentation
- Improved answer-set programming encodings for abstract argumentation
- The first international competition on computational models of argumentation: results and analysis
- On the Complexity of Probabilistic Abstract Argumentation Frameworks
- Methods for solving reasoning problems in abstract argumentation -- a survey
Uses Software
Recommendations
- On the Complexity of Probabilistic Abstract Argumentation Frameworks 👍 👎
- Towards fixed-parameter tractable algorithms for abstract argumentation 👍 👎
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence 👍 👎
- Complexity Classifications for Logic-Based Argumentation 👍 👎
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks 👍 👎
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation 👍 👎
- Declarative Algorithms and Complexity Results for Assumption-Based Argumentation 👍 👎
- Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation 👍 👎
- On incompleteness in abstract argumentation: complexity and expressiveness 👍 👎
- Complexity of abstract argumentation under a claim-centric view 👍 👎
This page was built for publication: Complexity-sensitive decision procedures for abstract argumentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490451)
