论文信息 - Assignment Precipitation in Fail First Search

Assignment Precipitation in Fail First Search

Within a fail first search, we relocate assignments towards the bottom of the upward-growing assignment stack. We do that when the related variables, due to search dynamics, become more constrained than were anticipated before. This fixes early variable selection mistakes.

[1] Kenneth N. Brown,et al. A General Framework for Reordering Agents Asynchronously in Distributed CSP , 2015, CP.

[2] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[3] Kostas Stergiou,et al. Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs , 2010, Fundam. Informaticae.

[4] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.

[5] Amnon Meisels,et al. Retroactive Ordering for Dynamic Backtracking , 2006, CP.

[6] Christian Bessiere,et al. Agile Asynchronous Backtracking for Distributed Constraint Satisfaction Problems , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[7] Amnon Meisels,et al. Min-domain retroactive ordering for Asynchronous Backtracking , 2009, Constraints.

[8] Amnon Meisels,et al. MAC-DBT Revisited , 2009, CSCLP.

[9] Lakhdar Sais,et al. Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[10] Jinbo Huang,et al. The Effect of Restarts on the Efficiency of Clause Learning , 2007, IJCAI.