@inproceedings{47eec444003d40e397d897105b70bfa7,
title = "Solving satisfiability problems on FPGAs using experimental unit propagation heuristic",
abstract = "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 hardware resources for the algorithm are less than those of MOM{\textquoteright}s heuristics.",
author = "Takayuki Suyama and Makoto Yokoo and Akira Nagoya",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999 ; Conference date: 12-04-1999 Through 16-04-1999",
year = "1999",
doi = "10.1007/BFb0097959",
language = "English",
isbn = "3540658319",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "709--711",
editor = "Jos{\'e} Rolim",
booktitle = "Parallel and Distributed Processing - 11 th IPPS/SPDP 1999 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, Proceedings",
address = "Germany",
}