Login / Signup
On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions.
Bernhard Bliem
Markus Hecher
Stefan Woltran
Published in:
COMMA (2016)
Keyphrases
</>
dynamic programming
tree decompositions
default theories
constraint satisfaction problems
constraint satisfaction
single machine