In Constraint Satisfaction Problems (CSP), variable ordering heuristics help to increase efficiency. Applying an appropriate heuristic can increase the performance of CSP solvers. On the other hand, if we apply specific heuristics for similar CSPs, CSP solver performance could be further improved. Similar CSPs can be grouped into same clusters. For each cluster, appropriate heuristics can be found by applying a local search. Thus, when a new CSP is created, the corresponding cluster can be found and the pre-calculated heuristics for the cluster can be applied. In this paper, we propose a new method for constraint solving which is called Cluster Specific Heuristic (CSH). We present and evaluate our method on the basis of example CSPs.
|Title of host publication||Advances in Artificial Intelligence: From Theory to Practice. IEA/AIE 2017|
|Place of Publication||Cham|
|Number of pages||10|
|Publication status||Published - 15 Jul 2017|
|Name||Lecture Notes in Computer Science|