6 citations · 17 across the 28 of their papers we have counts for
6 papers · 1 filter
The Model Counting Competition 2020
Johannes K. Fichte, Markus Hecher, Florim Hamiti
Many computational problems in modern society account to probabilistic reasoning, statistics, and combinatorics. A variety of these real-world questions can be solved by representi…
Solving the Steiner Tree Problem with few Terminals
Johannes K. Fichte, Markus Hecher, Andre Schidler
The Steiner tree problem is a well-known problem in network design, routing, and VLSI design. Given a graph, edge costs, and a set of dedicated vertices (terminals), the Steiner tr…
A Time Leap Challenge for SAT Solving
Johannes K. Fichte, Markus Hecher, Stefan Szeider
We compare the impact of hardware advancement and algorithm advancement for SAT solving over the last two decades. In particular, we compare 20-year-old SAT-solvers on new computer…
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
Markus Hecher, Jorge Fandinno
It is well-know that deciding consistency for normal answer set programs (ASP) is NP-complete, thus, as hard as the satisfaction problem for classical propositional logic (SAT). Th…
Structural Decompositions of Epistemic Logic Programs
Markus Hecher, Michael Morak, Stefan Woltran
Epistemic logic programs (ELPs) are a popular generalization of standard Answer Set Programming (ASP) providing means for reasoning over answer sets within the language. This riche…
Exploiting Database Management Systems and Treewidth for Counting
Johannes K. Fichte, Markus Hecher, Patrick Thier +1
Bounded treewidth is one of the most cited combinatorial invariants, which was applied in the literature for solving several counting problems efficiently. A canonical counting pro…