Massively parallel evolution of SAT heuristics

Authors:
Alex S. Fukunaga
Affiliations:
Global Edge Institute, Tokyo Institute of Technology, Meguro, Tokyo, Japan
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 15
Cited 0

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On the run-time behaviour of stochastic local search algorithms for SAT

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Local Search Algorithms for SAT: An Empirical Evaluation

Journal of Automated Reasoning
Evolutionary algorithms for the satisfiability problem

Evolutionary Computation
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Journal of Symbolic Computation
Automated discovery of composite SAT variable-selection heuristics

Eighteenth national conference on Artificial intelligence
GASAT: a genetic local search algorithm for the satisfiability problem

Evolutionary Computation
Clause Weighting Local Search for SAT

Journal of Automated Reasoning
Automated discovery of local search heuristics for satisfiability testing

Evolutionary Computation
Domain-independent extensions to GSAT: solving large structured satisfiability problems

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Building structure into local search for SAT

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Generating SAT local-search heuristics using a GP hyper-heuristic framework

EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent work has shown that it is possible to evolve heuristics for solving propositional satisfiability (SAT) problems which are competitive with the best hand-coded heuristics. However, previous work was limited by the computational resources required in order to evolve successful heuristics. In this paper, we describe a massively parallel genetic programming system for evolving SAT heuristics. Runs using up to 5.5 CPU core years of computation were executed, and resulted in new SAT heuristics which significantly outperform hand-coded heuristics.