First report on an adaptive density based branching rule for DLL-like SAT solvers , using a database for mixed random conjunctive normal forms created using the Advanced Encryption Standard ( AES )

We introduce an adaptive density-based heuristics hA for a given (DLLlike, otherwise arbitrary) SAT solver A, leading to a (hopefully) improved SAT solver A0. The determination of hA is motivated by a generalised threshold conjecture for random formulas, and exploits a database for satis ability and hardness of random formulas. To build up such a (large) database, a new reliable pseudo-random formula generator OKgenerator, based on AES (Advanced Encryption Standard), the successor of DES, is introduced.