6 citations · 17 across the 28 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.AI2022
Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder than SAT after All?
Markus Hecher
Answer Set Programming (ASP) is a paradigm for modeling and solving problems for knowledge representation and reasoning. There are plenty of results dedicated to studying the hardn…
cs.AI2022
Advanced Tools and Methods for Treewidth-Based Problem Solving -- Extended Abstract
Markus Hecher
Computer programs, so-called solvers, for solving the well-known Boolean satisfiability problem (Sat) have been improving for decades. Among the reasons, why these solvers are so f…