The constraint satisfaction problem (CSP) is an important framework in artificial intelligence
used to model eg qualitative reasoning problems such as Allen's interval algebra (A). There …

We study the fine-grained complexity of NP-complete, infinite-domain constraint satisfaction
problems (CSPs) parameterised by a set of first-order definable relations (with equality) …

A backdoor in a finite-domain CSP instance is a set of variables where each possible
instantiation moves the instance into a polynomial-time solvable class. Backdoors have …

Difference Logic (DL) is a fragment of linear arithmetics where atoms are constraints x+ k<=
y for variables x, y (ranging over Q or Z) and integer k. We study the complexity of deciding …

Qualitative reasoning is an important subfield of artificial intelligence where one describes
relationships with qualitative, rather than numerical, relations. Many such reasoning tasks …

We study the fine-grained complexity of NP-complete, infinite-domain constraint satisfaction
problems (CSPs) parameterised by a set of firstorder definable relations (with equality) …

A backdoor in a finite-domain CSP instance is a set of variables where each possible
instantiation moves the instance into a polynomial-time solvable class. Backdoors have …

Given a qualitative constraint network (QCN), a singleton-style consistency focuses on each
base relation (atom) of a constraint separately, rather than the entire constraint altogether …

A singleton-style consistency is a local consistency that verifies if each base relation (atom)
of each constraint of a qualitative constraint network (QCN) can serve as a support with …

The constraint satisfaction problem (CSP) is a powerful framework used in theoretical
computer science for formulating a multitude of problems. The CSP over a constraint …