Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
From MaRDI portal
Publication:2124467
DOI10.1016/j.artint.2022.103697OpenAlexW4220726332MaRDI QIDQ2124467
Andreas Niskanen, Marco Maratea, Thomas Linsbichler, Stefan Woltran, Johannes Peter Wallner
Publication date: 11 April 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103697
Related Items
Expressiveness of SETAFs and support-free ADFs under 3-valued semantics, Representing abstract dialectical frameworks with binary decision diagrams
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving QBF with counterexample guided refinement
- Complexity-sensitive decision procedures for abstract argumentation
- On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Argumentation in artificial intelligence
- The polynomial-time hierarchy
- The first international competition on computational models of argumentation: results and analysis
- Augmenting tractable fragments of abstract argumentation
- Conflict-driven answer set solving: from theory to practice
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Acceptance in incomplete argumentation frameworks
- Realizability of three-valued semantics for abstract dialectical frameworks
- How we designed winning algorithms for abstract argumentation and which insight we attained
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Bipolarity in argumentation graphs: towards a better understanding
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Lpopt: a rule optimization tool for answer set programming
- Understanding the Abstract Dialectical Framework
- Admissibility in the Abstract Dialectical Framework
- Expressiveness of Two-Valued Semantics for Abstract Dialectical Frameworks
- Counterexample-guided abstraction refinement for symbolic model checking
- On the number of bipolar Boolean functions
- Solving Advanced Argumentation Problems with Answer Set Programming
- On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs
- A discussion game for the grounded semantics of abstract dialectical frameworks
- On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
- Blocked Clause Elimination for QBF
- Computational Complexity
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
