Solving satisfiability problems on FPGAs using experimental unit propagation heuristic

Takayuki Suyama, Makoto Yokoo, Akira Nagoya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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’s heuristics.

Original languageEnglish
Title of host publicationParallel 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
EditorsJosé Rolim
PublisherSpringer Verlag
Pages709-711
Number of pages3
ISBN (Print)3540658319, 9783540658313
DOIs
Publication statusPublished - Jan 1 1999
Externally publishedYes
Event13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999 - San Juan, United States
Duration: Apr 12 1999Apr 16 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1586
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999
CountryUnited States
CitySan Juan
Period4/12/994/16/99

Fingerprint

Satisfiability Problem
Field Programmable Gate Array
Field programmable gate arrays (FPGA)
Logic circuits
Heuristics
Propagation
Unit
Logic
Reconfigurable Computing
Hardware
Resources

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Suyama, T., Yokoo, M., & Nagoya, A. (1999). Solving satisfiability problems on FPGAs using experimental unit propagation heuristic. In J. Rolim (Ed.), 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 (pp. 709-711). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1586). Springer Verlag. https://doi.org/10.1007/BFb0097959

Solving satisfiability problems on FPGAs using experimental unit propagation heuristic. / Suyama, Takayuki; Yokoo, Makoto; Nagoya, Akira.

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. ed. / José Rolim. Springer Verlag, 1999. p. 709-711 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1586).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Suyama, T, Yokoo, M & Nagoya, A 1999, Solving satisfiability problems on FPGAs using experimental unit propagation heuristic. in J Rolim (ed.), 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1586, Springer Verlag, pp. 709-711, 13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999, San Juan, United States, 4/12/99. https://doi.org/10.1007/BFb0097959
Suyama T, Yokoo M, Nagoya A. Solving satisfiability problems on FPGAs using experimental unit propagation heuristic. In Rolim J, editor, 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. Springer Verlag. 1999. p. 709-711. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0097959
Suyama, Takayuki ; Yokoo, Makoto ; Nagoya, Akira. / Solving satisfiability problems on FPGAs using experimental unit propagation heuristic. 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. editor / José Rolim. Springer Verlag, 1999. pp. 709-711 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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’s heuristics.",
author = "Takayuki Suyama and Makoto Yokoo and Akira Nagoya",
year = "1999",
month = "1",
day = "1",
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",

}

TY - GEN

T1 - Solving satisfiability problems on FPGAs using experimental unit propagation heuristic

AU - Suyama, Takayuki

AU - Yokoo, Makoto

AU - Nagoya, Akira

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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’s heuristics.

AB - 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’s heuristics.

UR - http://www.scopus.com/inward/record.url?scp=84925667117&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84925667117&partnerID=8YFLogxK

U2 - 10.1007/BFb0097959

DO - 10.1007/BFb0097959

M3 - Conference contribution

AN - SCOPUS:84925667117

SN - 3540658319

SN - 9783540658313

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 709

EP - 711

BT - 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

A2 - Rolim, José

PB - Springer Verlag

ER -