The Impact of Treewidth on Grounding and Solving of Answer Set Programs

DOI10.1613/jair.1.11515zbMath1494.68040OpenAlexW2998846663MaRDI QIDQ5208864

Michael Morak, Marius Moldovan, Bernhard Bliem, Stefan Woltran

Publication date: 22 January 2020

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11515

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (6)

Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? ⋮ Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs ⋮ Optimizing Answer Set Computation via Heuristic-Based Decomposition ⋮ selp: A Single-Shot Epistemic Logic Program Solver ⋮ A multiparametric view on answer set programming ⋮ DynASP2.5: Dynamic Programming on Tree Decompositions in Action

Uses Software

• Smodels
• Potassco

This page was built for publication: The Impact of Treewidth on Grounding and Solving of Answer Set Programs