Journal on Satisfiability Boolean Modeling and Computation · 2007 · 44 citations · 27 references
ComputingComputer ScienceAlgorithmsKnowledge RepresentationOptimizationConstraint SatisfactionRandomized ComputationArc ConsistencyTree SearchWorst-case ComplexityWorst-case Optimization
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. More precisely, nogoods are recorded when the current cutoff valu
27
Matthew W. Moskewicz, Conor Madigan, Ying Zhao et al. · 2001 · 2.9K citations
New methods to color the vertices of a graph
Daniel Brélaz · Communications of the ACM · 1979 · 1.6K citations · Full text
Laurent Geneste · Engineering Applications of Artificial Intelligence · 2004 · 865 citations
Using CSP look-back techniques to solve real-world SAT instances
Roberto J. Bayardo, Robert Schrag · 1997 · 598 citations
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
Patrick Prosser · Computational Intelligence · 1993 · 519 citations