Answer set solving with bounded treewidth revisited

DOI10.1007/978-3-319-61660-5_13zbMath1491.68042arXiv1702.02890OpenAlexW2591659253MaRDI QIDQ2401930

Markus Hecher, Michael Morak, Stefan Woltran, Johannes K. Fichte

Publication date: 5 September 2017

Full work available at URL: https://arxiv.org/abs/1702.02890

zbMATH Keywords

tree decompositionsparameterized algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30) Logic programming (68N17)

Related Items (9)

Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Solving projected model counting by utilizing treewidth and its limits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs ⋮ Default logic and bounded treewidth ⋮ Unnamed Item ⋮ A multiparametric view on answer set programming ⋮ DynASP2.5: Dynamic Programming on Tree Decompositions in Action

This page was built for publication: Answer set solving with bounded treewidth revisited