### Abstract

This paper presents a report on a new approach for solving satisfiability problems (SAT), i.e., creating a specialized logic circuit to solve each problem instance on Field Programmable Gate Arrays (FP-GAs). Recently, due to advances in FPGA technologies, users can now create their own reconfigurable logic circuits. Furthermore, by using current automatic logic synthesis technologies, users are able to design logic circuits automatically using a high level hardware description language (HDL). The combination of these two technologies have enabled users to rapidly create logic circuits specialized for solving individual problem instances. Satisfiability problems (SAT) were chosen because they make up an important subclass of NP-hard problems. We have developed a new algorithm called parallel-checking, which is suitable for this approach. In the algorithm, all variable values are assigned simultaneously, and all constraints are checked concurrently. Simulation results show that the order of the search tree size in this algorithm is approximately the same as that in the Davis-Putnam procedure. Then, we show how the parallel-checking algorithm can be implemented on FPGAs.

Original language | English |
---|---|

Title of host publication | Field-Programmable Logic |

Subtitle of host publication | Smart Applications, New Paradigms and Compilers - 6th International Workshop on Field-Programmable Logic and Applications, FPL 1996, Proceedings |

Editors | Reiner W. Hartenstein, Manfred Glesner |

Publisher | Springer Verlag |

Pages | 136-145 |

Number of pages | 10 |

ISBN (Print) | 9783540617303 |

DOIs | |

Publication status | Published - Jan 1 1996 |

Event | 6th International Workshop on Field-Programmable Logic and Applications, FPL 1996 - Darmstadt, Germany Duration: Sep 23 1996 → Sep 25 1996 |

### Publication series

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

Volume | 1142 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 6th International Workshop on Field-Programmable Logic and Applications, FPL 1996 |
---|---|

Country | Germany |

City | Darmstadt |

Period | 9/23/96 → 9/25/96 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Solving satisfiability problems on FPGAs'. Together they form a unique fingerprint.

## Cite this

*Field-Programmable Logic: Smart Applications, New Paradigms and Compilers - 6th International Workshop on Field-Programmable Logic and Applications, FPL 1996, Proceedings*(pp. 136-145). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1142). Springer Verlag. https://doi.org/10.1007/3-540-61730-2_14