research
∙
05/30/2023
Solving Projected Model Counting by Utilizing Treewidth and its Limits
In this paper, we introduce a novel algorithm to solve projected model c...
share
research
∙
04/27/2023
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF
The QSAT problem, which asks to evaluate a quantified Boolean formula (Q...
research
∙
01/18/2023
Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?
Answer Set Programming (ASP) is a problem modeling and solving framework...
research
∙
10/07/2022
Treewidth-aware Reductions of Normal ASP to SAT – Is Normal ASP Harder than SAT after All?
Answer Set Programming (ASP) is a paradigm for modeling and solving prob...
research
∙
08/24/2022
Advanced Tools and Methods for Treewidth-Based Problem Solving – Extended Abstract
Computer programs, so-called solvers, for solving the well-known Boolean...
research
∙
08/06/2021
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
Extending the popular Answer Set Programming (ASP) paradigm by introspec...
research
∙
12/02/2020
The Model Counting Competition 2020
Many computational problems in modern society account to probabilistic r...
research
∙
11/09/2020
Solving the Steiner Tree Problem with few Terminals
The Steiner tree problem is a well-known problem in network design, rout...
research
∙
08/05/2020
A Time Leap Challenge for SAT Solving
We compare the impact of hardware advancement and algorithm advancement ...
research
∙
07/09/2020
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
It is well-know that deciding consistency for normal answer set programs...
research
∙
01/13/2020
Structural Decompositions of Epistemic Logic Programs
Epistemic logic programs (ELPs) are a popular generalization of standard...
research
∙
01/13/2020
Exploiting Database Management Systems and Treewidth for Counting
Bounded treewidth is one of the most cited combinatorial invariants, whi...
research
∙
10/02/2019
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth
The problem of deciding the validity (QSAT) of quantified Boolean formul...
research
∙
07/24/2019
Inconsistency Proofs for ASP: The ASP-DRUPE Format
Answer Set Programming (ASP) solvers are highly-tuned and complex proced...
research
∙
05/05/2019
Answer Set Solving exploiting Treewidth and its Limits
Parameterized algorithms have been subject to extensive research of rece...
research
∙
03/27/2019
Treewidth and Counting Projected Answer Sets
In this paper, we introduce novel algorithms to solve projected answer s...
research
∙
11/28/2018
Counting Complexity for Reasoning in Abstract Argumentation
In this paper, we consider counting and projected model counting of exte...
research
∙
05/14/2018
Exploiting Treewidth for Projected Model Counting and its Limits
In this paper, we introduce a novel algorithm to solve projected model c...
research
∙
06/28/2017
Default Logic and Bounded Treewidth
In this paper, we study Reiter's propositional default logic when the tr...
research
∙
06/28/2017
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
A vibrant theoretical research area are efficient exact parameterized al...
research
∙
02/09/2017
Answer Set Solving with Bounded Treewidth Revisited
Parameterized algorithms are a way to solve hard problems more efficient...
research
∙
12/22/2016
