ML Anthology

Stochastic Local Search in K-Term DNF Learning

Ulrich Rückert, Stefan Kramer
ICML 2003 pp. 648-655
/icml/2003/ruckert2003icml-stochastic/

Abstract

A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and compared to the performance of GSAT and WalkSAT type algorithms on SAT encodings of k-term DNF problems. We also evaluate state-of-the-art separate and conquer algorithms on these problems. Finally, we demonstrate the practical relevance of our algorithm on a chess endgame database. ICML Proceedings of the Twentieth International Conference on Machine Learning

PDF ICML Semantic Scholar

Cite

Text

Rückert and Kramer. "Stochastic Local Search in K-Term DNF Learning." International Conference on Machine Learning, 2003.

Markdown

[Rückert and Kramer. "Stochastic Local Search in K-Term DNF Learning." International Conference on Machine Learning, 2003.](https://mlanthology.org/icml/2003/ruckert2003icml-stochastic/)

BibTeX

@inproceedings{ruckert2003icml-stochastic,
  title     = {{Stochastic Local Search in K-Term DNF Learning}},
  author    = {Rückert, Ulrich and Kramer, Stefan},
  booktitle = {International Conference on Machine Learning},
  year      = {2003},
  pages     = {648-655},
  url       = {https://mlanthology.org/icml/2003/ruckert2003icml-stochastic/}
}