dynASP

MaRDI QIDQ21796swMATHFDO

Official website http://link.springer.com/chapter/10.1007%2F978-3-642-15675-5_34

Described by source

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

Cited in

(11)

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

This page was built for software: dynASP