Sciweavers

CP
2003
Springer

Unrestricted Nogood Recording in CSP Search

13 years 9 months ago
Unrestricted Nogood Recording in CSP Search
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 signficant performance benefit.
George Katsirelos, Fahiem Bacchus
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where CP
Authors George Katsirelos, Fahiem Bacchus
Comments (0)