Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms

https://doi.org/10.1016/j.artint.2021.103505Get rights and content
Under a Creative Commons license
open access

Abstract

Many computational problems arising in, for instance, artificial intelligence can be realized as infinite-domain constraint satisfaction problems (CSPs) based on partition schemes: a set of pairwise disjoint binary relations (containing the equality relation) whose union spans the underlying domain and which is closed under converse. We first consider partition schemes that contain an acyclic order and where the constraint language contains all unions of the basic relations; such CSPs are frequently occurring in e.g. temporal and spatial reasoning. We identify properties of such orders which, when combined, are sufficient to establish NP-hardness of the CSP and strong lower bounds under the exponential-time hypothesis, even for degree-bounded problems. This result explains, in a uniform way, many existing hardness results from the literature, and shows that it is impossible to obtain subexponential time algorithms unless the exponential-time hypothesis fails. However, some of these problems (including several important temporal problems), despite likely not being solvable in subexponential time, admit non-trivial improved exponential-time algorithm, and we present a novel improved algorithm for RCC-8 and related formalisms.

Keywords

Constraint satisfaction problems
Infinite domains
Partition schemes
Lower bounds

Cited by (0)

Parts of this article appeared in the proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS-2018).