With the increased adoption of process mining, there is also a need for practical solutions
that work at industry scales. In this context, process querying methods (PQMs) have emerged …

W3C has recently introduced SHACL as a new standard for writing integrity constraints on
graph-structured data (specifically, on RDF graphs). Unfortunately, the standard defines the …

Graphs have emerged as a foundation for a variety of applications, including capturing factual
knowledge, semantic data integration, social networks, and informing machine learning …

Join queries involving many relations pose a severe challenge to today's query optimisation
techniques. To some extent, this is due to the fact that these techniques do not pay sufficient …

Constraint Satisfaction Problems (CSP) are notoriously hard. Consequently, powerful
decomposition methods have been developed to overcome this complexity. However, this poses …

Hypertree decompositions provide a way to evaluate Conjunctive Queries (CQs) in
polynomial time, where the exponent of this polynomial is determined by the width of the …

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

Identifying tractable problems and providing polynomial time algorithms for them has long
been a key focus in the study of computational complexity. More recently, the focus has been …

This thesis provides a uniform presentation of recent models for Quantifier Fuzzification
Mechanisms (QFMs). The idea of a QFM is at the core of a framework by Ingo Glöckner for …

Structural decomposition methods, such as generalized hypertree decompositions, have been
successfully used for solving constraint satisfaction problems (CSPs). As decompositions …