v1v2 (latest)

Clique-Width and Directed Width Measures for Answer-Set Programming

30 June 2016

Papers citing "Clique-Width and Directed Width Measures for Answer-Set Programming"

3 / 3 papers shown

Title
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth? Markus Hecher 21 2 0 18 Jan 2023
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All? Markus Hecher 62 25 0 07 Oct 2022
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs Viktor Besin Markus Hecher S. Woltran 38 4 0 06 Aug 2021