Publisher
Springer International Publishing
Reference65 articles.
1. F.A. Aloul, I.L. Markov, and K.A. Sakallah. Shatter: Efficient symmetry-breaking for Boolean satisfiability. In Proceedings of the 40th Design Automation Conference - DAC 2003, pages 836–839. ACM, 2003.
2. A.B. Baker. Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results. PhD thesis, University of Oregon, 1995.
3. C. Bessière. Constraint propagation. In F. Rossi, P. van Beek, and T. Walsh, editors, Handbook of Constraint Programming, chapter 3, pages 29–83. Elsevier, 2006.
4. F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais. Boosting systematic search by weighting constraints. In Proceedings of the 16th European Conference on Artificial Intelligence - ECAI 2004, pages 146–150. IOS Press, 2004.
5. L. Bordeaux, Y. Hamadi, and L. Zhang. Propositional satisfiability and constraint programming: A comparative survey. ACM Computing Surveys, 38(4):1–62, 2006.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The dilemma between arc and bounds consistency;International Journal of Intelligent Systems;2020-07-22