79 citations · 126 across the 29 of their papers we have counts for
11 papers · 1 filter
Epistemic Logic Programs: Non-Ground and Counting Complexity
Thomas Eiter, Johannes K. Fichte, Markus Hecher +1
Answer Set Programming (ASP) is a prominent problem-modeling and solving framework, whose solutions are called answer sets. Epistemic logic programs (ELP) extend ASP to reason abou…
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…
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…
Towards Faster Reasoners By Using Transparent Huge Pages
Johannes K. Fichte, Norbert Manthey, Julian Stecklina +1
Various state-of-the-art automated reasoning (AR) tools are widely used as backend tools in research of knowledge representation and reasoning as well as in industrial applications…
Inconsistency Proofs for ASP: The ASP-DRUPE Format
Mario Alviano, Carmine Dodaro, Johannes K. Fichte +3
Answer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer…
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
Johannes K. Fichte, Markus Hecher, Michael Morak +1
A vibrant theoretical research area are efficient exact parameterized algorithms. Very recent solving competitions such as the PACE challenge show that there is also increasing pra…
Answer Set Solving with Bounded Treewidth Revisited
Johannes Fichte, Markus Hecher, Michael Morak +1
Parameterized algorithms are a way to solve hard problems more efficiently, given that a specific parameter of the input is small. In this paper, we apply this idea to the field of…
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…
Strong Backdoors for Default Logic
Johannes K. Fichte, Arne Meier, Irina Schindler
In this paper, we introduce a notion of backdoors to Reiter's propositional default logic and study structural properties of it. Also we consider the problems of backdoor detection…
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
Albert Atserias, Johannes Klaus Fichte, Marc Thurley
We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. We do so by analyzing a co…
Backdoors to Normality for Disjunctive Logic Programs
Johannes Klaus Fichte, Stefan Szeider
Over the last two decades, propositional satisfiability (SAT) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. The aim…