79 citations · 126 across the 29 of their papers we have counts for
7 papers · 1 filter
Maximum Satisfiability of Simple Temporal Problems
Johannes K. Fichte, Johanna Groven, Peter Jonsson +2
The Simple Temporal Problem (STP) is a core framework for quantitative temporal constraints. As STP data can be inconsistent, we study MAXSTP: compute a maximum-cardinality consist…
Representative Sets in Propositional Abduction
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist +1
The propositional abduction problem is a well-known form of non-monotonic reasoning where we are asked to find an explanation of a given manifestation. Recently, there has been an…
Solving Projected Model Counting by Utilizing Treewidth and its Limits
Johannes K. Fichte, Markus Hecher, Michael Morak +2
In this paper, we introduce a novel algorithm to solve projected model counting (PMC). PMC asks to count solutions of a Boolean formula with respect to a given set of projection va…
Lower Bounds for QBFs of Bounded Treewidth
Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler
The problem of deciding the validity (QSAT) of quantified Boolean formulas (QBF) is a vivid research area in both theory and practice. In the field of parameterized algorithmics, t…
Treewidth and Counting Projected Answer Sets
Johannes K. Fichte, Markus Hecher
In this paper, we introduce novel algorithms to solve projected answer set counting (#PAs). #PAs asks to count the number of answer sets with respect to a given set of projected at…
Dual-normal Logic Programs - the Forgotten Class
Johannes K. Fichte, Miroslaw Truszczynski, Stefan Woltran
Disjunctive Answer Set Programming is a powerful declarative programming paradigm with complexity beyond NP. Identifying classes of programs for which the consistency problem is in…
Backdoors to Tractable Answer-Set Programming
Johannes Klaus Fichte, Stefan Szeider
Answer Set Programming (ASP) is an increasingly popular framework for declarative programming that admits the description of problems by means of rules and constraints that form a…