15 citations · 21 across the 13 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LO2016★ 2 cited
Counting Answer Sets via Dynamic Programming
Johannes Fichte, Markus Hecher, Michael Morak +1
While the solution counting problem for propositional satisfiability (#SAT) has received renewed attention in recent years, this research trend has not affected other AI solving pa…
cs.LO2016
lpopt: A Rule Optimization Tool for Answer Set Programming
Manuel Bichler, Michael Morak, Stefan Woltran
State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-ground programs containing variables into variable-free, propositional prog…