Local search characteristics of incomplete SAT procedures
Full Text: schuurmans00local.pdf
E ective local search methods for nding satisfying assignments of CNF formulae exhibit several systematic characteristics in their search. We identify a series of measurable characteristics of local search behavior that are predictive of problem solving eciency. These measures are shown to be useful for diagnosing ineciencies in given search procedures, tuning parameters, and predicting the value of innovations to existing strategies. We then introduce a new local search method, SDF
Citation
D. Schuurmans, F. Southey. "Local search characteristics of incomplete SAT procedures". Artificial Intelligence (AIJ), 132(2), pp 121--150, June 2001.| Keywords: | |
| Category: | In Journal |
BibTeX
@article{Schuurmans+Southey:AIJ01,
author = {Dale Schuurmans and Finnegan Southey},
title = {Local search characteristics of incomplete SAT procedures},
Volume = "132",
Number = "2",
Pages = {121--150},
journal = {Artificial Intelligence (AIJ)},
year = 2001,
}Last Updated: August 16, 2007Submitted by Russ Greiner
