Answer Set Solving with Bounded Treewidth Revisited

Answer Set Solving with Bounded Treewidth Revisited

9 February 2017

Johannes Fichte

ArXiv (abs)PDF HTML

Papers citing "Answer Set Solving with Bounded Treewidth Revisited"

12 / 12 papers shown

Title
Exact ASP Counting with Compact Encodings Mohimenul Kabir Supratik Chakraborty Kuldeep S. Meel 125 5 0 19 Dec 2023
IASCAR: Incremental Answer Set Counting by Anytime Refinement Johannes Fichte S. A. Gaggl Markus Hecher Dominik Rusovac 45 1 0 13 Nov 2023
Solving Projected Model Counting by Utilizing Treewidth and its Limits Johannes Fichte Markus Hecher Michael Morak Patrick Thier S. Woltran 97 8 0 30 May 2023
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All? Markus Hecher 60 25 0 07 Oct 2022
Rushing and Strolling among Answer Sets -- Navigation Made Easy Johannes Fichte S. A. Gaggl Dominik Rusovac 19 14 0 14 Dec 2021
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard Markus Hecher Jorge Fandinno 50 10 0 09 Jul 2020
Structural Decompositions of Epistemic Logic Programs Markus Hecher Michael Morak S. Woltran 33 15 0 13 Jan 2020
A Paraconsistent ASP-like Language with Tractable Model Generation A. Szałas LRM 16 0 0 20 Dec 2019
Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions Jeffrey M. Dudek L. Dueñas-Osorio Moshe Y. Vardi 40 20 0 12 Aug 2019
Exploiting Treewidth for Projected Model Counting and its Limits Johannes Fichte Michael Morak Markus Hecher S. Woltran 83 24 0 14 May 2018
Default Logic and Bounded Treewidth Johannes Fichte Markus Hecher Irena Schindler 102 14 0 28 Jun 2017
DynASP2.5: Dynamic Programming on Tree Decompositions in Action Johannes Fichte Markus Hecher Michael Morak S. Woltran 128 15 0 28 Jun 2017