Evolving a Neural Net-Based Decision and Search Heuristic for DPLL SAT Solvers

— Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT solvers for industrial applications are based on the DPLL algorithm with clause learning and conflict analysis

• Type: Conference
• Year: 2007
• Where: IJCNN
• Authors: Raihan H. Kibria
• Keywords: Boolean Satisfiability Problem, Efficient Sat Solvers, IJCNN 2007, Important Base Technology