Reasoning in assumption-based argumentation using tree-decompositions

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Argument graphs and assumption-based argumentation
A general account of argumentation with preferences
On the evaluation of argumentation formalisms
Computational properties of argument systems satisfying graph-theoretic constraints
An abstract, argumentation-theoretic approach to default reasoning
QBF as an alternative to Courcelle's theorem
The first international competition on computational models of argumentation: results and analysis
Towards fixed-parameter tractable algorithms for abstract argumentation
On the computational complexity of assumption-based argumentation for default reasoning.
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
Logic programs with stable model semantics as a constraint programming paradigm
Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Methods for solving reasoning problems in abstract argumentation -- a survey
Answer set solving with bounded treewidth revisited
A practical account into counting Dung's extensions by dynamic programming
The D-FLAT System for Dynamic Programming on Tree Decompositions
D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy
Defeasible logic programming: an argumentative approach
Declarative Algorithms and Complexity Results for Assumption-Based Argumentation
Lower Bounds for QBFs of Bounded Treewidth
Multi-shot ASP solving with clingo
Exploiting Database Management Systems and Treewidth for Counting

This page was built for publication: Reasoning in assumption-based argumentation using tree-decompositions