Backdoors to Tractable Answer-Set Programming

v1v2v3v4 (latest)

Backdoors to Tractable Answer-Set Programming

14 April 2011

Johannes Fichte

ArXiv (abs)PDF HTML

Papers citing "Backdoors to Tractable Answer-Set Programming"

14 / 14 papers shown

Title
Computational Short Cuts in Infinite Domain Constraint Satisfaction Peter Jonsson Victor Lagerkvist S. Ordyniak 65 0 0 18 Nov 2022
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard Markus Hecher Jorge Fandinno 69 10 0 09 Jul 2020
A Paraconsistent ASP-like Language with Tractable Model Generation A. Szałas LRM 16 0 0 20 Dec 2019
Lower Bounds for QBFs of Bounded Treewidth Johannes Fichte Markus Hecher A. Pfandler 59 24 0 02 Oct 2019
DynASP2.5: Dynamic Programming on Tree Decompositions in Action Johannes Fichte Markus Hecher Michael Morak S. Woltran 139 15 0 28 Jun 2017
Answer Set Solving with Bounded Treewidth Revisited Johannes Fichte Markus Hecher Michael Morak S. Woltran 125 43 0 09 Feb 2017
Clique-Width and Directed Width Measures for Answer-Set Programming B. Bliem S. Ordyniak S. Woltran 53 14 0 30 Jun 2016
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning Serge Gaspers Stefan Szeider 60 15 0 12 Jun 2014
Backdoors to Abduction A. Pfandler Stefan Rümmele Stefan Szeider 65 32 0 22 Apr 2013
Backdoors to Normality for Disjunctive Logic Programs Johannes Fichte Stefan Szeider LRM 64 36 0 08 Jan 2013
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs Johannes Fichte 87 7 0 15 Feb 2012
Backdoors to Satisfaction Serge Gaspers Stefan Szeider 100 90 0 28 Oct 2011
Limits of Preprocessing Stefan Szeider 120 14 0 29 Apr 2011
Augmenting Tractable Fragments of Abstract Argumentation S. Ordyniak Stefan Szeider 177 64 0 14 Apr 2011