Using CSP Look-Back Techniques to Solve Real-World SAT Instances (1997)

Cached

Download Links

by Roberto Bayardo Jr , Robert C. Schrag
Citations:43 - 0 self

Active Bibliography

34 Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances – Roberto J. Bayardo, Robert Schrag - 1996
46 Counting models using connected components – Roberto J. Bayardo, J. D. Pehoushek - 2000
50 Resolution versus Search: Two Strategies for SAT – Irina Rish, Rina Dechter - 2000
362 GSAT and Dynamic Backtracking – Matthew L. Ginsberg, David A. McAllester - 1994
1143 Chaff: Engineering an Efficient SAT Solver – Matthew W. Moskewicz , Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik - 2001
827 Adaptive Constraint Satisfaction – J. E. Borrett, E. P. K. Tsang, N. R. Walsh - 1996
582 Solving multiclass learning problems via error-correcting output codes – Thomas G. Dietterich, Ghulum Bakiri - 1995
492 A greedy randomized adaptive search procedure for the 2-partition problem – Thomas A. Feo, M. Pardalos - 1994
435 Planning as satisfiability – Henry Kautz, Bart Selman - 1992