NP is as easy as detecting unique solutions
Theoretical Computer Science
Graph theoretical structures in logic programs and default theories
Theoretical Computer Science
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Coherence in finite argument systems
Artificial Intelligence
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Preferred Extensions of Argumentation Frameworks: Query Answering and Computation
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
On bipolarity in argumentation frameworks
International Journal of Intelligent Systems - Bipolar Representations of Information and Preference Part 2: Reasoning and Learning
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Reasoning about preferences in argumentation frameworks
Artificial Intelligence
Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
A labeling approach to the computation of credulous acceptance in argumentation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The computational complexity of ideal semantics
Artificial Intelligence
Complexity of semi-stable and stage semantics in argumentation frameworks
Information Processing Letters
Reasoning in Argumentation Frameworks of Bounded Clique-Width
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Counterexample guided abstraction refinement algorithm for propositional circumscription
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Finding partitions of arguments with Dung's properties via SCSPs
Proceedings of the 2011 ACM Symposium on Applied Computing
Efficiently solving quantified bit-vector formulas
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Splitting an argumentation framework
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
An implementation of basic argumentation components
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Argumentation frameworks as constraint satisfaction problems
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
On the intertranslatability of argumentation semantics
Journal of Artificial Intelligence Research
CMODELS: SAT-based disjunctive answer set solver
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Symmetric argumentation frameworks
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Review: an introduction to argumentation semantics
The Knowledge Engineering Review
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Theory and Practice of Logic Programming
Quantifier elimination by lazy model enumeration
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
Splitting argumentation frameworks: an empirical evaluation
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
SAT-based counterexample-guided abstraction refinement
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Solving QBF with counterexample guided refinement
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Parameterized splitting: a simple modification-based approach
Correct Reasoning
Hi-index | 0.00 |
Abstract argumentation frameworks (AFs) provide the basis for various reasoning problems in the area of Artificial Intelligence. Efficient evaluation of AFs has thus been identified as an important research challenge. So far, implemented systems for evaluating AFs have either followed a straight-forward reduction-based approach or been limited to certain tractable classes of AFs. In this work, we present a generic approach for reasoning over AFs, based on the novel concept of complexity-sensitivity. Establishing the theoretical foundations of this approach, we derive several new complexity results for preferred, semi-stable and stage semantics which complement the current complexity landscape for abstract argumentation, providing further understanding on the sources of intractability of AF reasoning problems. The introduced generic framework exploits decision procedures for problems of lower complexity whenever possible. This allows, in particular, instantiations of the generic framework via harnessing in an iterative way current sophisticated Boolean satisfiability (SAT) solver technology for solving the considered AF reasoning problems. First experimental results show that the SAT-based instantiation of our novel approach outperforms existing systems.