Skip to main content
Go to the home page of the European Commission (opens in new window)
English English
CORDIS - EU research results
CORDIS
Content archived on 2024-06-18

Constraint Satisfaction Problems: Algorithms and Complexity

Objective

The complexity of Constraint Satisfaction Problems (CSPs) has become a major common research focus of graph theory, artificial intelligence, and finite model theory. A recently discovered connection between the complexity of CSPs on finite domains to central problems in universal algebra led to additional activity in the area.

The goal of this project is to extend the powerful techniques for constraint satisfaction to CSPs with infinite domains. The generalization of CSPs to infinite domains enhances dramatically the range of computational problems that can be analyzed with tools from constraint satisfaction complexity. Many problems from areas that have so far seen no interaction with constraint satisfaction complexity theory can be formulated using infinite domains (and not with finite domains), e.g. in phylogenetic reconstruction, temporal and spatial reasoning, computer algebra, and operations research. It turns out that the search for systematic complexity classification in infinite domain constraint satisfaction often leads to fundamental algorithmic results.

The generalization of constraint satisfaction to infinite domains poses several mathematical challenges: To make the universal algebraic approach work for infinite domain constraint satisfaction we need fundamental concepts from model theory. Luckily, the new mathematical challenges come together with additional strong tools, such as Ramsey theory or results from model theory. The most important challgenges are of an algorithmic nature: finding efficient algorithms for significant constraint languages, but also finding natural classes of problems that can be solved by a given algorithm.

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. See: https://op.europa.eu/en/web/eu-vocabularies/euroscivoc.

You need to log in or register to use this function

Topic(s)

Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.

Call for proposal

Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.

ERC-2010-StG_20091028
See other projects for this call

Funding Scheme

Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.

ERC-SG - ERC Starting Grant

Host institution

TECHNISCHE UNIVERSITAET DRESDEN
EU contribution
€ 223 951,60
Address
HELMHOLTZSTRASSE 10
01069 DRESDEN
Germany

See on map

Region
Sachsen Dresden Dresden, Kreisfreie Stadt
Activity type
Higher or Secondary Education Establishments
Links
Total cost

The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.

No data

Beneficiaries (2)

My booklet 0 0