The Marseille Constraint based Configuration Group
The web resource of the Configuration Team, member of the InCA Team, from the LSIS Laboratory, Marseille, France
Finite model search for constrained object models
Solving
The aim of a configuration solving procedure is to produce, if any exist, one or more possible models of a constrained object model. Based on constrained object models's finite model semantics, it resolves to finite model search.
People
Laurent Henocque (Associate Pr.)
Nicolas Prcovic (Assistant Pr.)
Mathieu Estratat (Post doc.)
Mathias Kleiner (Doctor)
and formerly
Stephane Grandcolas (Assistant Pr.)
Related Links
Associations
the Association Française pour la Programmation par Contraintes
CP Online, the web site of the ACP
Configuration tool providers
Z
Semantic Web
Solving
Although some models of a constrained object model may not be finitely represented, we have currently restricted our investigation to finite models search.
Finite model semantics
We define finite model semantics through an interpretation of COM elements and constraints.
Finite model search
Search can be achieved using either complete or incomplete methods. Both alternatives are currently investigated by the configuration team.
Complete methods
We primarly use ILOG's configuration tool JConfigurator. We have also developped several enhancement technics, such as symmetry breaking.
Incomplete methods
We have developped an algorithm based on Ant Colony Optimization.
LSIS
CNRS
Université de la Méditerranée
Université Paul Cézanne