Optimizing the initialization of dynamic decision heuristics in DPLL SAT solvers using genetic programming

Authors:
Raihan H. Kibria;You Li
Affiliations:
Computer Systems Lab, Dept. of Electrical Engineering and Information Technology, Darmstadt University of Technology, Darmstadt, Germany;Computer Systems Lab, Dept. of Electrical Engineering and Information Technology, Darmstadt University of Technology, Darmstadt, Germany
Venue:
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Year:
2006

Citing 3
Cited 3

Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference

There Is a Free Lunch for Hyper-Heuristics, Genetic Programming and Computer Scientists

EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Inc*: an incremental approach for improving local search heuristics

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Theoretical results in genetic programming: the next ten years?

Genetic Programming and Evolvable Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Boolean satisfiability problem (SAT) has many applications in electronic design automation (EDA) as well as theoretical computer science. Most SAT solvers for EDA problems use the DPLL algorithm and conflict analysis dependent decision heuristics. When the search starts, the heuristics have little or no information about the structure of the CNF. In this work, an algorithm for initializing dynamic decision heuristics is evolved using genetic programming. The open-source SAT solver MiniSAT v1.12 is used. Using the best algorithm evolved, an advantage was found for solving unsatisfiable EDA SAT problems.