The D-FLAT system for dynamic programming on tree decompositions
DOI10.1007/978-3-319-11558-0_39zbMATH Open1432.68053OpenAlexW277793977MaRDI QIDQ2938522FDOQ2938522
Authors: Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, 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
Recommendations
- D-FLAT: declarative problem solving using tree decompositions and answer-set programming
- D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy
- Efficient problem solving on tree decompositions using binary decision diagrams
- Improving the efficiency of dynamic programming on tree decompositions via machine learning
- Practical access to dynamic programming on tree decompositions
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cited In (11)
- Practical access to dynamic programming on tree decompositions
- D-FLAT: declarative problem solving using tree decompositions and answer-set programming
- D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy
- Complexity of secure sets
- Complexity of secure sets
- FLIC: application to caching of a dynamic dependency analysis for a 3D oriented CRS
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- D-FLAT
- Multi-shot ASP solving with clingo
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
- Reasoning in assumption-based argumentation using tree-decompositions
Uses Software
This page was built for publication: The D-FLAT system for dynamic programming on tree decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938522)
