Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results.

Makoto Yokoo Takayuki Suyama Hiroshi Sawada

Published in: CP (1996)

Keyphrases

satisfiability problem
field programmable gate array
solving hard
stochastic local search
sat instances
np complete
finite domain
temporal logic
hardware implementation

sat problem
phase transition
search algorithm
graph coloring problems
davis putnam
embedded systems
fpga technology
davis putnam logemann loveland
parallel computing

programmable logic
propositional logic
hardware design
random sat
computing systems
model checking
combinatorial problems
computational complexity
scheduling problem

constraint satisfaction problems
image processing algorithms
search problems
combinatorial optimization
low cost
hw sw
massively parallel
multi agent