A Scalable, Loadable Custom Programmable Logic Device for Solving Boolean Satisfiability Problems.
Mark J. BoydTracy LarrabeePublished in: FCCM (2000)
Keyphrases
- satisfiability problem
- programmable logic
- davis putnam logemann loveland
- solving hard
- stochastic local search
- sat instances
- np complete
- search algorithm
- finite domain
- conjunctive normal form
- phase transition
- sat problem
- graph coloring problems
- davis putnam
- first order logic
- temporal logic
- field programmable gate array
- constraint satisfaction problems
- pspace complete
- combinatorial problems
- constraint propagation
- cellular automata
- max sat
- mazurkiewicz traces