Unrestricted Nogood Recording and Restarting in CSP search
نویسنده
چکیده
Nogood recording is a known technique for pruning the search tree in backtracking search. Unfortunately, unrestricted nogood recording carries an overhead which has lead to the development of restricted forms of it. In this paper, we show how recent developments in the SAT literature can be applied in CSPs to facilitate unrestricted nogood recording. This in turn allows us to effectively use restarting. We present empirical data that show the resulting algorithms to be effective.
منابع مشابه
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 en...
متن کاملNogood Recording from Restarts
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...
متن کاملRecording and Minimizing Nogoods from Restarts
In this paper1., nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to the next ones. 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 and...
متن کاملNogood Recording for Static and Dynamic Constraint Satisfaction Problems
Many AI synthesis problems such as planning, scheduling or design may be encoded in a constraint satisfaction problems (CSP). A CSP is typically defined as the problem of finding any consistent labeling for a fixed set of variables satisfying all given constraints between these variables. However, for many real tasks, the set of constraints to consider may evolve because of the environment or b...
متن کاملThe Effect of Nogood Recording in MAC-CBJ SAT Algorithms
Propositional Satisfiability (SAT) solvers have been the subject of remarkable improvements in the last few years. Currently, the most successful SAT solvers share a number of similarities, being based on backtrack search, applying unit propagation, and incorporating a number of additional search reduction techniques. Most, if not all, of the search reduction techniques used by state-of-the-art...
متن کامل