A non-binary constraint ordering heuristic for constraint satisfaction problems

Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables and values should to be considered. Choosing the right order of variables and values can noticeably improve the efficiency of constraint satisfaction. Furthermore, the order in which constraints are studied can improve efficiency, particularly in problems with non-binary constraints. In this paper, we present a preprocess heuristic called Constraint Ordering Heuristic (COH) that studies the constrainedness of the scheduling problem and mainly classifies the constraints so that the tightest ones are studied first. Thus, constrainedness can be known in advance and overall inconsistencies can be found earlier and the number of constraint checks can significantly be reduced.

• Type: Journal
• Year: 2008
• Where: AMC
• Authors: Miguel A. Salido
• Keywords: Abstract Nowadays, AMC 2008, Constraint Satisfaction, Constraint Satisfaction Problems