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
∙
05/10/2022
A Quantitative Symbolic Approach to Individual Human Reasoning
Cognitive theories for reasoning are about understanding how humans come...
research
∙
12/14/2021
Rushing and Strolling among Answer Sets – Navigation Made Easy
Answer set programming (ASP) is a popular declarative programming paradi...
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
∙
04/29/2020
Towards Faster Reasoners By Using Transparent Huge Pages
Various state-of-the-art automated reasoning (AR) tools are widely used ...
research
∙
01/13/2020
Exploiting Database Management Systems and Treewidth for Counting
Bounded treewidth is one of the most cited combinatorial invariants, whi...
research
∙
07/24/2019
Inconsistency Proofs for ASP: The ASP-DRUPE Format
Answer Set Programming (ASP) solvers are highly-tuned and complex proced...
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/19/2016
