Accelerating Boolean Constraint Propagation for Efficient SAT-Solving on FPGAs
Open Access
- 12 June 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 305-309
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- SAT Solving with GPU Accelerated Inprocessing2021
- Verifying parallel dataflow transformations with model checking and its application to FPGAsJournal of Systems Architecture, 2019
- Hardware accelerated SAT solvers—A surveyJournal of Parallel and Distributed Computing, 2017
- A survey of SAT solverAIP Conference Proceedings, 2017
- FPGA acceleration of enhanced boolean constraint propagation for SAT solvers2013
- An Efficient Hardware Implementation of a SAT Problem Solver on FPGA2013
- An overview of parallel SAT solvingConstraints, 2012
- Designing an Efficient Hardware Implication Accelerator for SAT Solving2008
- FPGA-based SAT solver architecture with near-zero synthesis and layout overheadIEE Proceedings - Computers and Digital Techniques, 2000
- FPGA technology mapping for power minimization1994