Constraint Programming (CP) has been successful in a number of combinatorial search and discrete optimisation problems. Yet other more traditional approaches, such as Integer Programming (IP), can ...
Abstract: In this paper, we propose a generalization of the processing of Boolean constraints in CLP by introducing a new type of constraint, the pseudo-equality, which can be used to partially ...
Abstract: This paper proposes an efficient method for evaluating queries over constraint databases. The method is based on a combination of top-down resolution with memoing and closed form bottom-up ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback