Combining Nogoods in Restart-Based Search
Nogood recording is a form of learning that has been shown useful for solving constraint satisfaction problems. One simple approach involves recording nogoods that are extracted from the rightmost branches of the successive trees built by a backtrack search algorithm with restarts. In this paper, we propose several mechanisms to reason with so-called increasing-nogoods that exactly correspond to the states reached at the end of each search run. Interestingly, some similarities that can be observed between increasing-nogoods allow us to propose new original ways of dynamically combining them in order to improve the overall filtering capability of the learning system. Our preliminary results show the practical interest of our approach.
KeywordsLearning Increasing nogoods Restarts Filtering
This work has been supported by the project CPER DATA from the “Hauts-de-France” Region.
- 1.Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of 16th European Conference on Artificial Intelligence, ECAI 2004, Including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, 22–27 August 2004, pp. 146–150. IOS Press (2004)Google Scholar
- 4.Frost, D., Dechter, R.: Dead-end driven learning. In: Proceedings of 12th National Conference on Artificial Intelligence, Seattle, WA, USA, 31 July - 4 August 1994, vol. 1, pp. 294–300. AAAI Press/The MIT Press (1994)Google Scholar
- 9.Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood recording from restarts. In: IJCAI 2007, Proceedings of 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 6–12 January 2007, pp. 131–136 (2007)Google Scholar
- 11.Lecoutre, C., Tabary, S.: Symmetry-reinforced nogood recording from restarts. In: 11th International Workshop on Symmetry in Constraint Satisfaction Problems (SymCon 2011), Perugia, Italy, pp. 13–27 (2011)Google Scholar
- 12.Lee, J.H.M., Schulte, C., Zhu, Z.: Increasing nogoods in restart-based search. In: Proceedings of 30th AAAI Conference on Artificial Intelligence, 12–17 February 2016, Phoenix, Arizona, USA, pp. 3426–3433. AAAI Press (2016)Google Scholar