ML Anthology

Tabu Search for SAT

Bertrand Mazure, Lakhdar Sais, Éric Grégoire
AAAI 1997 pp. 281-285
/aaai/1997/mazure1997aaai-tabu/

Abstract

In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Selman et al. Random Walk Strategy GSAT procedure, in short RWS-GSAT. TSAT does not involve the additional

PDF AAAI Semantic Scholar

Cite

Text

Mazure et al. "Tabu Search for SAT." AAAI Conference on Artificial Intelligence, 1997.

Markdown

[Mazure et al. "Tabu Search for SAT." AAAI Conference on Artificial Intelligence, 1997.](https://mlanthology.org/aaai/1997/mazure1997aaai-tabu/)

BibTeX

@inproceedings{mazure1997aaai-tabu,
  title     = {{Tabu Search for SAT}},
  author    = {Mazure, Bertrand and Sais, Lakhdar and Grégoire, Éric},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1997},
  pages     = {281-285},
  url       = {https://mlanthology.org/aaai/1997/mazure1997aaai-tabu/}
}