Corpus ID: 17292807

Nogood Recording from Restarts

@inproceedings{Lecoutre2007NogoodRF,
  title={Nogood Recording from Restarts},
  author={Christophe Lecoutre and Lakhdar Sais and S{\'e}bastien Tabary and Vincent Vidal},
  booktitle={IJCAI},
  year={2007}
}
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, no-goods 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… Expand
Recording and Minimizing Nogoods from Restarts
In this paper, 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. MoreExpand
Combining Nogoods in Restart-Based Search
TLDR
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. Expand
Domain-Splitting Generalized Nogoods from Restarts
TLDR
This paper further generalized the learned nogoods but now using domain-splitting branching and set branching and believes that the use of restarts and learning of domain- Splitting generalized nogOODs will improve backtrack search algorithms for certain classes of problems. Expand
Using nogoods information from restarts in domain-splitting search
TLDR
Inspired by activity-b ased heuristics of SAT solvers, this work proposes to include ds-nogood information in the heuristic decision, and shows that this allows some problems to be solved more efficiently. Expand
A heuristic based on domain-splitting nogoods from restarts
TLDR
Inspired by activity-based heuristics of SAT solvers, a variable selection heuristic based on ds-nogoods is proposed and evaluated and shows that this allows some problems to be solved more efficiently. Expand
A Study of Adaptive Restarting Strategies for Solving Constraint Satisfaction Problems
In this paper we present a study of four generic strategies for solving constraint satisfaction problems (CSPs) of any kind, be they soluble or insoluble. All four methods combine learning withExpand
Conflict Ordering Search for Scheduling Problems
TLDR
A new generic scheme to guide backtrack search, called Conflict Ordering Search (COS), that reorders variables on the basis of conflicts that happen during search, that remembers the last variables on which search decisions failed. Expand
Breaking Out CSPs
In this paper, we present the very efficient and unparametrized local search algorithm called Weighted Min-Conflicts (WMC), based on Morris’ Breakout Method, and show how the relationship existingExpand
Search Tree Restructuring
Poor branching decisions in a search tree can increase solve time by orders of magnitude. We introduce a new approach where, instead of committing to the tree so far, we restructure the treeExpand
NACRE - A Nogood And Clause Reasoning Engine
TLDR
This paper presents the kernel, the available search algorithms, and the default settings, which makes NACRE efficient in practice when used as a black-box solver. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Unrestricted Nogood Recording in CSP Search
TLDR
This paper demonstrates how recent nogood recording techniques from SAT can be generalized to CSPs, and reports on some preliminary empirical results which indicate that generalized nogOOD recording can have a significant performance benefit. Expand
Nogood Recording for static and dynamic constraint satisfaction problems
TLDR
A new class of constraint recording algorithms called Nogood Recording is proposed that may be used for solving both static and dynamic CSPs and offers an interesting compromise, polynomially bounded in space, between an ATMS-like approach and the usual static constraint satisfaction algorithms. Expand
A Random Jump Strategy for Combinatorial Search
TLDR
A new randomization strategy which offers the same advantage of the restart strategy but it can be used with any branching heuristics, and is implemented in SATO, an efficient implementation of the Davis-Putnam-Loveland method for SAT problems. Expand
Generalized NoGoods in CSPs
TLDR
It is demonstrated that nogoods in CSPs (as standardly defined) are too restrictive and can be lifted so that a CSP solver can learn more general and powerful nogOODs. Expand
Boosting Systematic Search by Weighting Constraints
TLDR
A dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (CSP) and which avoids some trashing by first instantiating variables involved in the constraints that have frequently participated in dead-end situations. Expand
Conflict analysis in search algorithms for propositional satisfiability
TLDR
Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances. Expand
Backjump-based techniques versus conflict-directed heuristics
TLDR
A general algorithm which gives a uniform view of several state-of-the-art systematic backtracking search algorithms for solving both binary and nonbinary CSP instances and studies the interest of backjump-based techniques with respect to conflict-directed variable ordering heuristics. Expand
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
TLDR
The results show that incorporating CSP look-back techniques renders easy many problems which otherwise are beyond DP's reach, and recommend that such techniques be included as options in implementations of DP, just as they are in systematic algorithms for the more general constraint satisfaction problem. Expand
An Extensible SAT-solver
TLDR
This article presents a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff, and includes among other things a mechanism for adding arbitrary boolean constraints. Expand
MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems
TLDR
This paper tries to convince once and for all the CSP community that MAC is not only more efficient than FC to solve large practical problems, but it is also really more efficient on hard and large random problems. Expand
...
1
2
3
4
...