Hypertree width is a prominent hypergraph invariant with many algorithmic applications in
constraint satisfaction and databases. We propose two novel characterisations for hypertree …

The organizers of the 4th Parameterized Algorithms and Computational Experiments
challenge (PACE 2019) report on the 4th iteration of the PACE challenge. This year, the first …

We present a new approach for learning the structure of a treewidth-bounded Bayesian
Network (BN). The key to our approach is applying an exact method (based on MaxSAT) …

The Program Committee of the Third Parameterized Algorithms and Computational
Experiments challenge (PACE 2018) reports on the third iteration of the PACE challenge …

To cope with the intractability of answering Conjunctive Queries (CQs) and solving
Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions …

We propose a new algorithmic method for computing the hypertree width of hypergraphs,
and we evaluate its performance empirically. At the core of our approach lies a novel …

In this paper, we consider counting and projected model counting of extensions in abstract
argumentation for various semantics. When asking for projected counts we are interested in …

Abstract Constraint Satisfaction Problems (CSPs) play a central role in many applications in
Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete …

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. In …

Treedepth is an increasingly popular graph invariant. Many NP-hard combinatorial problems
can be solved efficiently on graphs of bounded treedepth. Since the exact computation of …