The D-FLAT system for dynamic programming on tree decompositions
From MaRDI portal
Publication:2938522
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
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
- D-FLAT
- FLIC: application to caching of a dynamic dependency analysis for a 3D oriented CRS
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- 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
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)