Project-Contraintes:CHRat

Team Contraintes

Members

Overall Objectives

Introduction
Highlight: Model-checking generalized to constraint solving
Highlight: Robustness measure of temporal logic properties

Scientific Foundations

Concurrent constraint programming
Constraint solvers
Computational systems biology

Application Domains

Combinatorial optimization problems
In-silico cell processes

Software

BIOCHAM
Rules2CP
CHRat
CLPGUI

New Results

Linear Logic Concurrent Constraint Programming and Constraint Handling Rules
Rule-based Modeling of Constraint Satisfaction Problems
Modelling Search in Rules2CP
Symmetry Detection and Breaking in Constraint Satisfaction Problems
Trace Development Methodology
Petri Net Representation of Biological Networks
Model Reductions by Graph Transformations
Analysis of Interlocked Positive Feedback Loops
Temporal Logic Constraint Solving
Parameter Search w.r.t. Temporal Logic Properties
Robustness Analysis w.r.t. Temporal Logic Properties
Automated selection of PADE models by symbolic model checking
Modeling the Cell Cycle
Modeling G protein-Coupled Signal Transduction

Other Grants and Activities

National contracts
European contracts
International contracts
Invitations

Dissemination

Teaching
Leadership within scientific community

Bibliography

Publications of the year

Inria / Raweb 2009
Presentation of the Project Contraintes

Section: Software

CHRat

Participant : Thierry Martinez.

CHRat is a modular version of the well known Constraint Handling Rules language CHR, called for CHRat for CHR with ask and tell . Inspired by the LLCC framework, this extension of CHR makes it possible to reuse CHRat components both in rules and guards in other CHRat components, and define hierarchies of constraint solvers. CHRat is a bootstrapped preprocessor for CHR implemented in Prolog.

Logo Inria