Objectif
The constraint satisfaction problem (CSP) is a computational problem where the instance consists of a finite set of variables and a finite set of constraints, and the goal is to decide if there is a mapping from the variables to elements of some fixed domain of values satisfying all the constraints. Such problems are ubiquitous in different areas of computer science, including artificial intelligence, scheduling, computational linguistics, computational biology, and combinatorial optimisation. InfCSP will use mathematical tools to study the descriptive complexity of infinite domain constraint satisfaction problems.
The main purpose of InfCSP is to understand the power of generic logic-based algorithms for CSPs with infinite domains of values. More precisely, we will analyse the class of CSPs parametrised by the type of constraints allowed in the instance in order to determine for which problems in this class the set of YES instances can be captured by a logical formula. The logics of interest will be Datalog and the first-order logic extended by a fixed-point operator, widely studied in the context of constraint satisfaction. The classifications will be obtained using methods from descriptive complexity, universal algebra and model theory. InfCSP will constitute a major step forward in understanding which infinite domain CSPs can be solved in polynomial time and developing new universal-algebraic tools for infinite domain CSP.
Champ scientifique
Mots‑clés
Programme(s)
Régime de financement
MSCA-IF - Marie Skłodowska-Curie Individual Fellowships (IF)Coordinateur
CB2 1TN Cambridge
Royaume-Uni