The D-FLAT System for Dynamic Programming on Tree Decompositions

DOI10.1007/978-3-319-11558-0_39zbMath1432.68053OpenAlexW277793977MaRDI QIDQ2938522

Frederico Dusberger, Günther Charwat, Bernhard Bliem, Markus Hecher, Michael Abseher, Stefan Woltran

Publication date: 14 January 2015

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_39

zbMATH Keywords

treewidthtree decompositionsanswer set programming

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (6)

The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing ⋮ Practical Access to Dynamic Programming on Tree Decompositions ⋮ Complexity of secure sets ⋮ Multi-shot ASP solving with clingo ⋮ D-FLAT ⋮ Complexity of Secure Sets

Uses Software

• Gringo
• clasp
• Clingo
• iClingo

This page was built for publication: The D-FLAT System for Dynamic Programming on Tree Decompositions