79 citations · 126 across the 29 of their papers we have counts for
38 papers
A Polynomial-Time Algorithm for the Minimal Input/Output Node Cardinality Disturbance Decoupling Problem via Output Feedback
Luca Claude Gino Lebon, Jorke de Vlas, Johannes K. Fichte +1
In this paper, we propose an algorithm that solves, in polynomial-time, the minimal input/output node cardinality disturbance decoupling problem via output feedback. The optimal so…
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…
Diversity of Extensions in Abstract Argumentation
Johannes K. Fichte, Markus Hecher, Yasir Mahmood +1
Argumentation is an important topic of AI for modelling and reasoning about arguments. In abstract argumentation, we consider directed graphs, so-called argumentation frameworks (A…
Structure-Aware Encodings of Argumentation Properties for Clique-width
Yasir Mahmood, Markus Hecher, Johanna Groven +1
Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known th…
Complexity of Faceted Explanations in Propositional Abduction
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist +1
Abductive reasoning is a popular non-monotonic paradigm that aims to explain observed symptoms and manifestations. It has many applications, such as diagnosis and planning in artif…
Facets in Argumentation: A Formal Approach to Argument Significance
Johannes Fichte, Nicolas Fröhlich, Markus Hecher +4
Argumentation is a central subarea of Artificial Intelligence (AI) for modeling and reasoning about arguments. The semantics of abstract argumentation frameworks (AFs) is given by…
The Model Counting Competitions 2021-2023
Johannes K. Fichte, Markus Hecher
Modern society is full of computational challenges that rely on probabilistic reasoning, statistics, and combinatorics. Interestingly, many of these questions can be formulated by…
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…
Counting and Reasoning with Plans
David Speck, Markus Hecher, Daniel Gnad +2
Classical planning asks for a sequence of operators reaching a given goal. While the most common case is to compute a plan, many scenarios require more than that. However, quantita…
Rejection in Abstract Argumentation: Harder Than Acceptance?
Johannes K. Fichte, Markus Hecher, Yasir Mahmood +1
Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and…
IASCAR: Incremental Answer Set Counting by Anytime Refinement
Johannes K. Fichte, Sarah Alice Gaggl, Markus Hecher +1
Answer set programming (ASP) is a popular declarative programming paradigm with various applications. Programs can easily have many answer sets that cannot be enumerated in practic…
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…
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…
A Quantitative Symbolic Approach to Individual Human Reasoning
Emmanuelle Dietz, Johannes K. Fichte, Florim Hamiti
Cognitive theories for reasoning are about understanding how humans come to conclusions from a set of premises. Starting from hypothetical thoughts, we are interested which are the…
Rushing and Strolling among Answer Sets -- Navigation Made Easy
Johannes K. Fichte, Sarah Alice Gaggl, Dominik Rusovac
Answer set programming (ASP) is a popular declarative programming paradigm with a wide range of applications in artificial intelligence. Oftentimes, when modeling an AI problem wit…
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…
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…
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…
Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019
Jorge Fandinno, Johannes Fichte
This is the Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2019, which was held in Philadelphia, USA, June 3rd , 2019.
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…
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…