Constraint programming is a successful technology for solving a wide range of problems in business and industry which require satisfying a set of constraints. Central to solving constraint satisfaction problems is enforcing a level of local consistency. In this thesis, we propose efficient filtering algorithms for enforcing strong local consistencies. In addition, since such filtering algorithms can be too expensive to enforce all the time, we propose some automated heuristics that can dynamically select the most appropriate filtering algorithm. Published by AI Access, a not-for-profit publisher of open access texts with a highly respected scientific board. We publish monographs and collected works. Our texts are available electronically for free and in hard copy at close to cost.In addition, our results, along with ones in , show that approximating strong and complex local consistencies can be ... Since only light versions of maxRPC are practical for use during search, we have only tested heuristics H1, H2 and H3 . Recall that heuristics H4 and H5 are not applicable for light maxRPC algorithms.
|Title||:||Efficient Algorithms for Strong Local Consistencies and Adaptive Techniques in Constraint Satisfaction Problems|
|Publisher||:||Lulu.com - 2015-03-24|