Counting Complexity for Reasoning in Abstract Argumentation

28 November 2018

Papers citing "Counting Complexity for Reasoning in Abstract Argumentation"

6 / 6 papers shown

Title
Advancing Algorithmic Approaches to Probabilistic Argumentation under the Constellation Approach Andrei Popescu J. Wallner 25 0 0 06 Jul 2024
Abstract Dialectical Frameworks are Boolean Networks (full version) Jesse Heyninck Matthias Knorr João Leite 22 3 0 02 Jul 2024
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework Yasir Mahmood Arne Meier Johannes Schmidt 13 1 0 23 Feb 2021
Exploiting Database Management Systems and Treewidth for Counting Johannes Fichte Markus Hecher Patrick Thier S. Woltran 37 24 0 13 Jan 2020
Lower Bounds for QBFs of Bounded Treewidth Johannes Fichte Markus Hecher A. Pfandler 44 24 0 02 Oct 2019
DynASP2.5: Dynamic Programming on Tree Decompositions in Action Johannes Fichte Markus Hecher Michael Morak S. Woltran 128 15 0 28 Jun 2017