Recently spectacular improvements in the performance of SAT solvers have been achieved through nogood recording (clause learning). In the CSP literature, on the other hand, nogood recording remains a fairly minor technique for improving backtracking algorithms. In this paper we demonstrate how recent nogood recording techniques from SAT can be generalized to CSPs. The result is a significant enhancement over current nogood recording techniques used in CSPs. We also report on some preliminary empirical results which indicate that generalized nogood recording can have a significant performance benefit. © Springer-Verlag 2003.
CITATION STYLE
Katsirelos, G., & Bacchus, F. (2003). Unrestricted nogood recording in CSP search. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2833, 873–877. https://doi.org/10.1007/978-3-540-45193-8_70
Mendeley helps you to discover research relevant for your work.