logo

SCIENCE CHINA Information Sciences, Volume 64 , Issue 7 : 179102(2021) https://doi.org/10.1007/s11432-018-9877-x

Revisiting the efficacy of weak consistencies: a study of forward checking

More info
  • ReceivedOct 22, 2018
  • AcceptedApr 8, 2019
  • PublishedOct 27, 2020

Abstract

There is no abstract available for this article.


References

[1] Lecoutre C, Vion J. Enforcing arc consistency using bitwise operations. Constraint Programming Letters (CPL), 2008, 2: 21-35. Google Scholar

[2] Guo J, Li Z, Zhang L, et al. MaxRPC algorithms based on bitwise operations. In: Proceedings of International Conference on Principles and Practice of Constraint Programming, Perugia, 2011. 373--384. Google Scholar

[3] Balafrej A, Bessiere C, Bouyakhf E H, et al. Adaptive singleton-based consistencies. In: Proceedings of AAAI'14, Québec City, 2014. 2601--2607. Google Scholar

[4] Paparrizou A, Stergiou K. On Neighborhood Singleton Consistencies. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence. Melbourne, 2017. 736--742. Google Scholar

[5] Bessiere C. Constraint Propagation. Found Artif Intell, 2006, 2: 29--83. Google Scholar

[6] Stergiou K. Restricted path consistency revisited. In: Proceedings of International Conference on Principles and Practice of Constraint Programming, Cork, 2015. 419--428. Google Scholar

[7] Boussemart. XCSP3 benchmarks website. 2019. http://xcsp.org/series. Google Scholar