%0 Conference Paper %1 fukunaga:2002:AAAI %A Fukunaga, Alex %B Proceedings of the National Conference on Artificial Intelligence (AAAI) %D 2002 %K algorithms, constraint genetic local programming, satisfaction, satisfiability, search %P 641--648 %T Automated Discovery of Composite SAT Variable Selection Heuristics %U http://www.bol.ucla.edu/~fukunaga/AAAI02.pdf %X Variants of GSAT and Walksat are among the most successful SAT local search algorithms. We show that several well-known SAT local search algorithms are the results of novel combinations of a set of variable selection primitives. We describe CLASS, an automated heuristic discovery system which generates new, effective variable selection heuristic functions using a simple composition operator. New heuristics discovered by CLASS are shown to be competitive with the best Walksat variants, including Novelty and R-Novelty . We also analyse the local search behaviour of the learned heuristics using the depth, mobility, and coverage metrics recently proposed by Schuurmans and Southey.

@inproceedings{fukunaga:2002:AAAI, abstract = {Variants of GSAT and Walksat are among the most successful SAT local search algorithms. We show that several well-known SAT local search algorithms are the results of novel combinations of a set of variable selection primitives. We describe CLASS, an automated heuristic discovery system which generates new, effective variable selection heuristic functions using a simple composition operator. New heuristics discovered by CLASS are shown to be competitive with the best Walksat variants, including Novelty and R-Novelty . We also analyse the local search behaviour of the learned heuristics using the depth, mobility, and coverage metrics recently proposed by Schuurmans and Southey.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Fukunaga, Alex}, biburl = {https://www.bibsonomy.org/bibtex/2fc13b5fcdf44be86d22ee8e119f2e13c/brazovayeye}, booktitle = {Proceedings of the National Conference on Artificial Intelligence (AAAI)}, interhash = {514b0899fbacc1db798cb97f21428aae}, intrahash = {fc13b5fcdf44be86d22ee8e119f2e13c}, keywords = {algorithms, constraint genetic local programming, satisfaction, satisfiability, search}, pages = {641--648}, timestamp = {2008-06-19T17:39:55.000+0200}, title = {Automated Discovery of Composite {SAT} Variable Selection Heuristics}, url = {http://www.bol.ucla.edu/~fukunaga/AAAI02.pdf}, year = 2002 }