55 citations · 277 across the 43 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LO2012★ 3 cited
Complexity of super-coherence problems in ASP
Mario Alviano, Wolfgang Faber, Stefan Woltran
Adapting techniques from database theory in order to optimize Answer Set Programming (ASP) systems, and in particular the grounding components of ASP systems, is an important topic…
cs.AI2012
D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming
Bernhard Bliem, Michael Morak, Stefan Woltran
In this work, we propose Answer-Set Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms…