Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Applications of Rule-Based Constraint Programming

A research project funded by Academy of Finland (project number 53695)
Jan 1, 2002 - Dec 31, 2005

Project leader: Prof. Ilkka Niemelä

Research Personnel: Keijo Heljanko, Tomi Janhunen, Tommi Junttila, Toni Jussila, Timo Latvala, Tommi Syrjänen, Heikki Tauriainen, Misa Keinänen, Matti Järvisalo, Emilia Oikarinen, Tuomo Pyhälä


Summary: The project aims to develop novel efficient computational methods for rule-based constraints with the goal of applying the techniques in interesting applications. This is a continuation of a project titled ``Constraint programming based on default rules'' where we have developed basic implementation methodology and applications for a new kind of declarative rule-based constraint programming paradigm. An implementation of the approach developed in the project, the Smodels system, is actively used in dozens of research groups all over the world.

The project does basic research on computational properties of rule-based constraints and methods building on them. We aim to extend the approach with efficient techniques for numerical constraints and Boolean functions which are useful in many interesting domains. We have chosen two promising areas, product configuration and symbolic model checking, as the first target applications. We plan to develop sophisticated methodology for both domains exploiting the underlying mathematical properties of the applications. In addition, we look for a fruitful interaction of theory and practice through challenging case studies to accelerate and focus the development of computational techniques.


For software and theses see the home page of the logic group.