Optimizing the Initialization of Dynamic Decision Heuristics in DPLL SAT Solvers Using Genetic Programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8098
- @InProceedings{eurogp06:KibriaLi,
-
author = "Raihan H. Kibria and You Li",
-
title = "Optimizing the Initialization of Dynamic Decision
Heuristics in {DPLL SAT} Solvers Using Genetic
Programming",
-
editor = "Pierre Collet and Marco Tomassini and Marc Ebner and
Steven Gustafson and Anik\'o Ek\'art",
-
booktitle = "Proceedings of the 9th European Conference on Genetic
Programming",
-
publisher = "Springer",
-
series = "Lecture Notes in Computer Science",
-
volume = "3905",
-
year = "2006",
-
address = "Budapest, Hungary",
-
month = "10 - 12 " # apr,
-
organisation = "EvoNet",
-
keywords = "genetic algorithms, genetic programming",
-
ISBN = "3-540-33143-3",
-
pages = "331--340",
-
DOI = "doi:10.1007/11729976_30",
-
bibsource = "DBLP, http://dblp.uni-trier.de",
-
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 initialising 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.",
-
notes = "Part of \cite{collet:2006:GP} EuroGP'2006 held in
conjunction with EvoCOP2006 and EvoWorkshops2006",
- }
Genetic Programming entries for
Raihan H Kibria
Li You
Citations