activity
20122023
most citedselp: A Single-Shot Epistemic Logic Program Solver

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

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…