1 citations · 1 across the 5 of their papers we have counts for
3 papers · 1 filter
Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming
Wolfgang Faber, Michael Morak, Lukáš Chrpa
In the context of planning and reasoning about actions and change, we call an action reversible when its effects can be reverted by applying other actions, returning to the origina…
Exploiting Treewidth for Projected Model Counting and its Limits
Johannes K. Fichte, Michael Morak, Markus Hecher +1
In this paper, we introduce a novel algorithm to solve projected model counting (PMC). PMC asks to count solutions of a Boolean formula with respect to a given set of projected var…
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…