Descriptive Complexity of Infinite Domain Constraint Satisfaction Problems

Project Information

InfCSP

Grant agreement ID: 795936

DOI 10.3030/795936

Project terminated on 3 March 2020

EC signature date 10 April 2018

Start date 1 July 2018

End date 29 April 2021

Funded under

• EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions

Total cost € 195 454,80

EU contribution € 195 454,80

Coordinated by

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UNIVERSITY OF CAMBRIDGE
United Kingdom

Objective

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.

Fields of science (EuroSciVoc)

CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques.

• natural sciences › computer and information sciences › artificial intelligence
• humanities › languages and literature › linguistics
• natural sciences › mathematics › pure mathematics › discrete mathematics › mathematical logic
• natural sciences › mathematics › pure mathematics › algebra

You need to log in or register to use this function

Keywords

• Infinite Domain Constraint Satisfaction Problem
• Descriptive Complexity
• Datalog
• Fixed Point Logic
• Universal Algebra

Programme(s)

• H2020-EU.1.3. - EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions Main Programme
• H2020-EU.1.3.2. - Nurturing excellence by means of cross-border and cross-sector mobility

Topic(s)

• MSCA-IF-2017 - Individual Fellowships

Call for proposal

H2020-MSCA-IF-2017

Funding Scheme

MSCA-IF - Marie Skłodowska-Curie Individual Fellowships (IF)

Coordinator

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UNIVERSITY OF CAMBRIDGE

• Net EU contribution: € 195 454,80
• Address: TRINITY LANE THE OLD SCHOOLS ; CB2 1TN Cambridge ; United Kingdom
• Activity type: Higher or Secondary Education Establishments
• Total cost: € 195 454,80