D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy

DOI10.3233/FI-2016-1397zbMath1374.68490OpenAlexW2551391766MaRDI QIDQ4589187

Stefan Woltran, Bernhard Bliem, Günther Charwat, Markus Hecher

Publication date: 9 November 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1397

zbMATH Keywords

dynamic programmingartificial intelligencetree decompositionanswer-set programmingsubset minimization

Mathematics Subject Classification ID

Dynamic programming (90C39) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Exploiting Database Management Systems and Treewidth for Counting ⋮ Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs ⋮ Default logic and bounded treewidth ⋮ DynASP2.5: Dynamic Programming on Tree Decompositions in Action ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers

This page was built for publication: D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy