Proceedings

Nogood Recording from Restarts

Download BibTeX Cite

Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 131-135.

Abstract

In this paper, nogood recording is investigated within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to the next one. More precisely, nogoods are recorded when the current cutoff value is reached, i.e. before restarting the search algorithm. Such a set of nogoods is extracted from the last branch of the current search tree. Interestingly, the number of nogoods recorded before each new run is bounded by the length of the last branch of the search tree. As a consequence, the total number of recorded nogoods is polynomial in the number of restarts. Experiments over a wide range of CSP instances demonstrate the effectiveness of our approach.

Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, and Vincent Vidal. 2007. Nogood Recording from Restarts. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07. IJCAI, 131–135. https://ijcai.org/proceedings/2007/19
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards