CORDIS Project
Funding breakdown and partner intelligence are Premium
Sign in and upgrade to Premium for EU contribution totals, consortium analytics, OpenAlex research context, and AI summaries. · 0 consortium intelligence fields visible of 1
Start free • Cancel anytime • 14-day refund guarantee
The InfCSP project investigates constraint satisfaction problems with infinite domains using mathematical tools. It aims to understand the effectiveness of logic-based algorithms in solving these problems, focusing on the classification of instances based on the types of constraints involved.
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. I…
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 EuroSciVoc fields.
Guests see up to 5 topics.
Guests see up to 5 keywords.
