Solving satisfiability problems using reconfigurable computing.
Takayuki SuyamaMakoto YokooHiroshi SawadaAkira NagoyaPublished in: IEEE Trans. Very Large Scale Integr. Syst. (2001)
Keyphrases
- satisfiability problem
- solving hard
- stochastic local search
- sat instances
- np complete
- finite domain
- temporal logic
- search algorithm
- graph coloring problems
- phase transition
- sat problem
- davis putnam logemann loveland
- combinatorial problems
- davis putnam
- stochastic local search algorithms
- combinatorial optimization
- propositional logic
- dynamic programming
- mazurkiewicz traces
- constraint propagation
- constraint satisfaction problems
- weighted max sat
- search space