Efficient Singleton Consistency by Combining Forward Checking and Bound Consistency
2014 ◽
Vol 23
(04)
◽
pp. 1460017
Keyword(s):
Maintaining local consistencies can improve the efficiencies of the search algorithms solving constraint satisfaction problems (CSPs). Comparing with arc consistency which is the most widely used local consistency, stronger local consistencies can make the search space smaller while they require higher computational cost. In this paper, we make an attempt on the compromise between the pruning ability and the computational cost. A new local consistency called singleton strong bound consistency (SSBC) and its light version, light SSBC, are proposed. The search algorithm maintaining light SSBC can outperform MAC on a considerable number of problems.
2011 ◽
Vol 21
(4)
◽
pp. 733-744
◽
2001 ◽
Vol 1
(6)
◽
pp. 713-750
◽
2008 ◽
Vol 105
(40)
◽
pp. 15253-15257
◽
2020 ◽
Vol 34
(02)
◽
pp. 1644-1651
2001 ◽
Vol 14
◽
pp. 53-81
◽
2020 ◽
Vol 11
(2)
◽
pp. 192-207
◽
2003 ◽
Vol 17
(05)
◽
pp. 781-815
◽