Using CLP to find out the fastest strategy to get solution for certain CSPs. Jamie Xu, Dr. Hodgson

1. Using CLP to find out the fastest strategy to get solution for certain CSPs. Jamie Xu, Dr. Hodgson Department of Computer Science Abstract CLP is short for Constraint Logic Programming, it is logic programming with constraint feature. The difference between CLP and LP is showing on the right. CSP is short for Constraint Satisfaction Problem, for solving CSP, we will set a bunch of variables and try to evaluate them. If we can find a way to evaluate all the variables under the constraints, that means we’ve found a solution for the CSP, otherwise, we have to do backtracking to try other possible solutions. Prolog is the programming language we used, there are two reasons: First, as a logic programming language, prolog is good at recursion and backtracking. Second, as a logic programming language with labeling feather, it provides us a way to make our own strategy combination about which variable to choose next and how to evaluate it. This makes it possible to find out the best strategy combination for certain type of CSPs. Conclusion FF--Random is always the best(or one of the best) labeling strategy combination. For those problems which treat values as symbols (ie, value 2 and 3 are just like two different symbols a and b, there is no relation like 2<3 have to hold.)