Constraint Solving by Martine Ceberio


EUROPE

APES GROUP : Algorithms, Problems and Empirical Studies

Address: Department of Computer Science
University of of Strathclyde
Glasgow

ASTRA Constraints Research Group

Analysis, Synthesis and Transformation / Reformulation of Algorithms in Constraint Technology

Address:
Computing Science Division
Department of Information Technology
Uppsala University, Box 337
SE-751 05 Uppsala, Sweden
  • People:
    • Pierre Flener (Pierre.Flener@it.uu.se)
    • Justin Pearson (Justin.Pearson@it.uu.se)
  • Links:
  • Research:
    • Theory and practice of constraint technology
    • Design of solver-independent, declarative, high-level constraint modelling languages, suitable for both complete and local search.

Oxford University Computing Laboratory

Address:
Computing Science Division
University Offices,
Wellington Square
Oxford OX1 2JD
  • People:
    • Peter Jeavons (Peter.Jeavons@comlab.ox.ac.uk)
    • Georg Gottlob (Georg.Gottlob@comlab.ox.ac.uk)
    • David Cohen (D.Cohen@rhul.ac.uk)
    • Martin Green
  • Links:
  • Research:
    • Soft Constraints
    • Groebner Bases
    • Computational Molecular Biology (applications of CP)
    • Radio Frequency Planning (applications of CP)

Cork Constraint Computation Centre

Cork Constraint Computation Centre also called 4C, the Cork constraint computation centre is a major constraints group involved in lot of research dealing with Automation of modeling domain knowledge, Applications, Adaptability and Acceleration of efficient solvers in the field of constraint technology.

Address:
Cork Constraint Computation Centre,
University College Cork,
Cork, Ireland

Programming systems Group and Intelligent Systems laboratory

Address:
Intelligent Systems Laboratory
Swedish Institute of Computer Science
Box 1263
SE-164 29 Kista
Sweden

Constraint Programming and Optimization Laboratory

Address:
Department of Computer Science
University of Essex
Colchester CO4 3SQ UK

European Research Consortium for Informatics and Mathematics (ERCIM)

Address:
Chairman: François Fages
INRIA Rocquencourt
Phone: +33 1 39635709
E-mail:Francois.Fages@inria.fr

This is a working group involved in the research on Constraints to promote research on this subject within the ERCIM institutions and to facilitate exchange of information and researchers for long and short visits.

  • People:
    • Since this is a very large group with lot of institutions and members affiliated to it there are also
      lots of researchers involved. So please refer to the website listed below to get a better understanding of the
      various research activities that are being carried out in the field of constraints
  • Group Link:
  • Research:
    • ERCIM constitutes research groups from different parts of the whole of Europe.
      Workshops are also conducted and constraint related papers are submitted from time to time.

Constraint Programming Research at York

Address:
Department of Computer Science,
University of York, Heslington,
York, YO10 5DD

Constraint & Logic Programming research group at Charles University, Prague

Address: Charles University
Faculty of Mathematics and Physics
Department of Theoretical Computer Science
Malostranske namesti 2/25
118 00 Praha 1, Czech Republic

 

  • People:
    • Roman Barták – (bartak@kti.mff.cuni.cz)
    • Petr Stepanek (stepanek@ksi.ms.mff.cuni.cz) – No available website available
    • Jan Hric – (hric@barbora.ms.mff.cuni.cz)
  • Group Link:
  • Research:
    • Multi-agent Technology
    • Advanced Planning and Scheduling
    • Transformations of Logic Programs
    • Meta-Programming
    • Constraint Programming (Solving over-constrained problems and decision support systems)
    • Augmenting Logic Programming with Functional Principle

LISBON Constraint Programming Group (LCPG- CENTRIA)

Address: LCPG – CENTRIA
Campus de Campolide
1099-085 Lisboa

(LCPG- CENTRIA):is an institutionalized research centre of Universidade Nova de Lisboa. CENTRIA is the largest national AI centre whose main areas of activity include Constraints and Soft Computing.