Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems

by   Georg Gottlob, et al.

Answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs) are arguably among the most fundamental tasks in Computer Science. They are classical NP-complete problems. Consequently, the search for tractable fragments of these problems has received a lot of research interest over the decades. This research has traditionally progressed along three orthogonal threads. a) Reformulating queries into simpler, equivalent, queries (semantic optimization) b) Bounding answer sizes based on structural properties of the query c) Decomposing the query in such a way that global consistency follows from local consistency. Much progress has been made by various works that connect two of these threads. Bounded answer sizes and decompositions have been shown to be tightly connected through the important notions of fractional hypertree width and, more recently, submodular width. recent papers by Barceló et al. study decompositions up to generalized hypertree width under semantic optimization. In this work, we connect all three of these threads by introducing a general notion of semantic width and investigating semantic versions of fractional hypertree width, adaptive width, submodular width and the fractional cover number.



There are no comments yet.


page 1

page 2

page 3

page 4


Constraint Solving via Fractional Edge Covers

Many important combinatorial problems can be modeled as constraint satis...

Complexity Analysis of General and Fractional Hypertree Decompositions

Hypertree decompositions (HDs), as well as the more powerful generalized...

On Functional Aggregate Queries with Additive Inequalities

Motivated by fundamental applications in databases and relational machin...

HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings

To cope with the intractability of answering Conjunctive Queries (CQs) a...

Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems

Constraint satisfaction problems (CSPs) are an important formal framewor...

Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width

Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width ...

Boolean Tensor Decomposition for Conjunctive Queries with Negation

We propose an algorithm for answering conjunctive queries with negation,...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.