|
 Constraint Reasoning
Future generations of software applications will increasingly rely on automated reasoning technologies. Central to these applications is the ability to search through a large set of possibilities (schedules, plans, program executions, etc.) and to find the ones that optimally match the requirements of the user. The goal of the Constraint Reasoning group is to develop the next generation of optimisation technology to accompany the development of these new applications.
This vision supposes the resolution of two major scientific challenges. First, optimisation technologies must be usable by mainstream software developers. Second, these technologies must become highly scalable to accommodate increasingly high volumes of data. These two challenges are at the core of the research conducted in the Constraint Reasoning group.
To improve automated reasoning usability, we develop new optimisation algorithms which can autonomously adapt their problem-solving strategy to the application domain. To improve scalability, we develop algorithms that are able to seamlessly exploit multiple computing resources like multi-cores and high-performance clusters.
|
|
Current Projects
-
Disolver — The distributed constraint solver shipped as a C++/MPI library. It defines complete and incomplete combinatorial searches facilities for parallel and distributed frameworks.
|
Code
- Distributed Scheduling — A simulator comparing four distributed scheduling algorithms on random log-based reconciliation problems.
- QED — A solver for quantified Boolean and linear constraints.
|
Collaborations
- Muhammed Basharu, Cork Constraint Computation Center (4C), Ireland
- Fabien Corblin, Université Joseph Fourier (Grenoble I) IMAG-LSR, France
- Andy Grayland, University of St Andrews, UK
- Gilles Raymond, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), France
- David Stynes, Cork Constraint Computation Center (4C), Ireland
|
Careers
- We are selecting interns on a yearly basis to closely work with us on our projects
|
|
|
|
