FPGA based runtime configurable clause evaluator for SAT problems

An FPGA based clause evaluator for Boolean satisfiability problems is prese nted in which a customised bitstream is directly generated from the problem specification,avoiding the need for resynthesis. A three orders of magnitu de improvement in reconfiguration time was seen over the standard approach for a 50 variable, 80 clause problem.