Highly Influenced

# Simulated annealing for hard satisfiability problems

@inproceedings{Spears1993SimulatedAF, title={Simulated annealing for hard satisfiability problems}, author={William M. Spears}, booktitle={Cliques, Coloring, and Satisfiability}, year={1993} }

- Published 1993 in Cliques, Coloring, and Satisfiability

Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary boolean expression true. This paper compares a simulated annealing algorithm (SASAT) with GSAT (Selman et al., 1992), a greedy algorithm for solving satisfiability problems. GSAT can solve problem instances that are extremely difficult for traditional satisfiability algorithms. Results suggest that SASAT scales up better as the number of variables increases, solving at least as many hard SAT problemsâ€¦Â CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

69 Citations

13 References

Similar Papers