D-FLAT

swMATH9895MaRDI QIDQ21874FDOQ21874

Author name not available (Why is that?)

Described by source

• The D-FLAT system for dynamic programming on tree decompositions

Cited In (7)

• Practical access to dynamic programming on tree decompositions
• D-FLAT: declarative problem solving using tree decompositions and answer-set programming
• Practical access to dynamic programming on tree decompositions
• Multi-shot ASP solving with clingo
• Declarative dynamic programming as an alternative realization of Courcelle's theorem
• The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
• Methods for solving reasoning problems in abstract argumentation -- a survey

This page was built for software: D-FLAT