DynASP2.5: Dynamic Programming on Tree Decompositions in Action

DOI10.4230/LIPIcs.IPEC.2017.17zbMath1443.68164arXiv1706.09370OpenAlexW2963867061MaRDI QIDQ5111876

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

Publication date: 27 May 2020

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

zbMATH Keywords

tree decompositionsparameterized algorithmsmulti-pass dynamic programmingfixed-parameter linear time

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Dynamic programming (90C39) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (9)

Solving projected model counting by utilizing treewidth and its limits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Default logic and bounded treewidth ⋮ Unnamed Item ⋮ Testing in ASP: revisited language and programming environment ⋮ dynASP ⋮ A multiparametric view on answer set programming ⋮ DynASP2.5: Dynamic Programming on Tree Decompositions in Action

Cites Work

• Unnamed Item
• Courcelle's theorem -- a game-theoretic approach
• Fixed-parameter complexity in AI and nonmonotonic reasoning
• Extending and implementing the stable model semantics
• Conflict-driven answer set solving: from theory to practice
• On the computational cost of disjunctive logic programming: Propositional case
• Answer set solving with bounded treewidth revisited
• Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
• D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy
• Anytime answer set optimization via unsatisfiable core shrinking
• DynASP2.5: Dynamic Programming on Tree Decompositions in Action
• The Impact of Treewidth on Grounding and Solving of Answer Set Programs

This page was built for publication: DynASP2.5: Dynamic Programming on Tree Decompositions in Action