dynASP

swMATH9817MaRDI QIDQ21796FDOQ21796

Author name not available (Why is that?)

Described by source

• DynASP2.5: Dynamic Programming on Tree Decompositions in Action

Cited In (7)

• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• A multiparametric view on answer set programming
• Solving projected model counting by utilizing treewidth and its limits
• A dynamic-programming based ASP-solver
• Backdoors to tractable answer set programming
• Default logic and bounded treewidth
• The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration

This page was built for software: dynASP