Generating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework

We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific subset of instances of a problem. We test the heuristics evolved by GP-HH against well-known local-search heuristics on a variety of benchmark SAT problems. Results are very encouraging.

• Type: Conference
• Year: 2007
• Where: AE
• Authors: Mohamed Bahy Bader-El-Den, Riccardo Poli
• Keywords: AE 2007, Artificial Intelligence, Heuristics, Local-search 3-SAT Heuristics, Well-known Local-search Heuristics