.png){kind=icon}
Return
A non-binary constraint ordering heuristic for constraint satisfaction problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.08.064.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2007 Elsevier Inc. All rights reserved.
Keywords:
heuristic search
constraint ordering
non-binary constraints
constrainedness
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
View more