2 citations · 4 across the 11 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2023★ 1 cited
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
Johannes K. Fichte, Robert Ganian, Markus Hecher +2
The QSAT problem, which asks to evaluate a quantified Boolean formula (QBF), is of fundamental interest in approximation, counting, decision, and probabilistic complexity and is al…
cs.LO2023★ 1 cited
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?
Markus Hecher
Answer Set Programming (ASP) is a problem modeling and solving framework for several problems in KR with growing industrial applications. Also for studies of computational complexi…
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…