Symbiosis of Search and Heuristics for Random 3-SAT

A machine program for theorem-proving

Davis, M., Logemann, G., Loveland, D.: · 1962

Earlier work this paper cites.

Limited discrepancy search, Morgan Kaufmann (1995) 607–613

Harvey, W.D., Ginsberg, M.L.: · 1995

Earlier work this paper cites.

Improved limited discrepancy search

Korf, R.E.: · 1996

Earlier work this paper cites.

Heuristics based on unit propagation for satisfiability problems

Li, C.M., Anbulagan: · 1997

Earlier work this paper cites.

Depth-bounded discrepancy search

Walsh, T.: · 1997

Cited alongside, same era.

A constraint-based approach to narrow search trees for satisfiability

Li, C.M.: · 1999

Cited alongside, same era.

Heavy-tailed phenomena in satisfiability and constraint satisfaction problems

Gomes, C.P., Selman, B., Crato, N., Kautz, H.: · 2000

Cited alongside, same era.

A backbone-search heuristic for efficient solving of hard 3-SAT formulae

Dubois, O., Dequen, G.: · 2001

Cited alongside, same era.

Investigating the behaviour of a SAT solver on random formulas

Kullmann, O.: · 2002

Later among the works it cites.

Whose side are you on? finding solutions in a biased search-tree

Heule, M.J.H., van Maaren, H.: · 2006

Later among the works it cites.

Handbook of Satisfiability. Volume 185 of Frontiers in Artificial Intelligence and Applications

Original

Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T., eds.: · 2009

Later among the works it cites.