|
Artelys Kalis - Constraint Programming
Constraint programming combines innovations from several fields:
operations research, artificial intelligence, discrete mathematics
and graph theory.
Variables of constraint programming problems are described
by the sets of their possible values, called domains. Constraints
then restrict these sets of possible values. Constraints can
be arithmetical, linear, logical or semantic.
The constraint programming system automatically deduces
(propagates) the possible or impossible values for every variable
from the constraint expressions. A tree structure completes
this propagation mechanism in order to find either every possible
solution or the optimal one, with respect to some criterion.
To
know more about constraint programming
Contact
For more information about Artelys Kalis, please contact us
at:
•
Tel: +33 1 44 77 89 00
•
E-mail: info-kalis@artelys.com
|
