research
∙
10/29/2022
Linear Programs with Conjunctive Database Queries
In this paper, we study the problem of optimizing a linear program whose...
share
research
∙
08/23/2021
Geometric Amortization of Enumeration Algorithms
In this paper, we introduce the technique of geometric amortization for ...
research
∙
03/10/2019
Knowledge compilation languages as proof systems
In this paper, we study proof systems in the sense of Cook-Reckhow for p...
research
∙
01/11/2019
Dependency Weighted Aggregation on Factorized Databases
We study a new class of aggregation problems, called dependency weighted...
research
∙
11/07/2018
Connecting Knowledge Compilation Classes and Width Parameters
The field of knowledge compilation establishes the tractability of many ...
research
∙
10/09/2018
Enumerating models of DNF faster: breaking the dependency on the formula size
In this article, we study the problem of enumerating the models of DNF f...
research
∙
08/15/2018
Counting Minimal Transversals of β-Acyclic Hypergraphs
We prove that one can count in polynomial time the number of minimal tra...
research
∙
07/11/2018
Knowledge Compilation, Width and Quantification
We generalize many results concerning the tractability of SAT and #SAT o...
research
∙
08/25/2017
Non-FPT lower bounds for structural restrictions of decision DNNF
We give a non-FPT lower bound on the size of structured decision DNNF an...
research
∙
01/05/2017
Understanding the complexity of #SAT using knowledge compilation
Two main techniques have been used so far to solve the #P-hard problem #...
research
∙
05/23/2014
Understanding model counting for β-acyclic CNF-formulas
We extend the knowledge about so-called structural restrictions of #SAT ...
research
∙
01/24/2014
