|
Artelys Kalis - Functionalities
Problem definition
The architecture of Artelys Kalis offers a rich and flexible
syntax to describe a problem's characteristics: variables,
domains, constraints and possibly objectives. Classical semantic
constraints (or global constraints) facilitate the problem's
description.
Solution
Artelys Kalis implements the latest algorithmic advances in
constraint propagation. It uses a tree search that can be
controlled by predefined branching strategies. Designed as
generic objects, they make it possible to define branching
strategies based on business knowledge.
Tuning
Together with branching strategies, several settings enable
the user to specify a maximum time the tree search will run,
the number of required solutions, etc. Developers can also
finely control the tree search and propagation levels of output.
This functionality proves useful for monitoring and adapting
the exploration strategy.
Definition of new constraints
Artelys Kalis also enables the re-definition of constraints
and the description of their propagation mechanisms. These
new constraints are added to the library of available constraints
and can facilitate the solution of problems that have a particular
structure.
Contact
For more information about Artelys Kalis, please contact us
at:
•
Tel: +33 1 44 77 89 00
•
E-mail: info-kalis@artelys.com
|
