Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic

@inproceedings{Suyama1999SolvingSP,
  title={Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic},
  author={Takayuki Suyama and Makoto Yokoo and Akira Nagoya},
  booktitle={IPPS/SPDP Workshops},
  year={1999}
}
This paper presents new results on an approach for solving satisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field Programmable Gate Arrays (FPGAs). This approach has become feasible due to recent advances in Reconfigurable Computing. We develop an algorithm that is suitable for a logic circuit implementation. This algorithm is basically equivalent to the Davis-Putnam procedure with Experimental Unit Propagation. The required… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…