We propose a framework for deployment and subsequent autonomic management of component-based distributed applications. An initial deployment goal is specified using a declarative ...
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
What makes a good consistency ? Depending on the constraint, it may be a good pruning power or a low computational cost. By "weakening" arc-consistency, we propose to de...
Andrei Legtchenko, Arnaud Lallouet, AbdelAli Ed-Db...
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...