Opendata, web and dolomites

InfCSP TERMINATED

Descriptive Complexity of Infinite Domain Constraint Satisfaction Problems

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "InfCSP" data sheet

The following table provides information about the project.

Coordinator
THE CHANCELLOR MASTERS AND SCHOLARSOF THE UNIVERSITY OF CAMBRIDGE 

Organization address
address: TRINITY LANE THE OLD SCHOOLS
city: CAMBRIDGE
postcode: CB2 1TN
website: www.cam.ac.uk

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country United Kingdom [UK]
 Total cost 195˙454 €
 EC max contribution 195˙454 € (100%)
 Programme 1. H2020-EU.1.3.2. (Nurturing excellence by means of cross-border and cross-sector mobility)
 Code Call H2020-MSCA-IF-2017
 Funding Scheme MSCA-IF-EF-ST
 Starting year 2018
 Duration (year-month-day) from 2018-07-01   to  2021-04-29

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    THE CHANCELLOR MASTERS AND SCHOLARSOF THE UNIVERSITY OF CAMBRIDGE UK (CAMBRIDGE) coordinator 195˙454.00

Map

 Project 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.

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "INFCSP" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "INFCSP" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.3.2.)

NeuroSens (2019)

Neuromodulation of Sensory Processing

Read More  

EPIC (2019)

Evolution of Planktonic Gastropod Calcification

Read More  

POMOC (2019)

Charles IV and the power of marvellous objects

Read More