On the public citation graph

Reconfigurable hardware SAT solvers: a survey of systems

0 signed · 116 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-44614-1_50openalex-snapshot
A Parallel Pipelined SAT Solver for FPGA’s
inferredcites →https://doi.org/10.1007/3-540-61551-2_96openalex-snapshot
Solving satisfiability problems using field programmable gate arrays: First results
inferredcites →https://doi.org/10.1007/3-540-63465-7_250openalex-snapshot
Satisfiability on reconfigurable hardware
inferredcites →https://doi.org/10.1007/978-3-540-45234-8_48openalex-snapshot
Hardware Implementations of Real-Time Reconfigurable WSAT Variants
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_31openalex-snapshot
Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation
inferredcites →https://doi.org/10.1007/978-3-540-48302-1_64openalex-snapshot
A Runtime Reconfigurable Implementation of the GSAT Algorithm
inferredcites →https://doi.org/10.1007/978-3-662-04131-4openalex-snapshot
How to Solve It: Modern Heuristics
inferredcites →https://doi.org/10.1007/bfb0017441openalex-snapshot
Reconfigurable architectures: A new vision for optimization problems
inferredcites →https://doi.org/10.1007/bfb0055234openalex-snapshot
Acceleration of satisfiability algorithms by reconfigurable hardware
inferredcites →https://doi.org/10.1007/bfb0055260openalex-snapshot
Solving boolean satisfiability with dynamic hardware configurations
inferredcites →https://doi.org/10.1007/s10472-004-9424-1openalex-snapshot
The SAT2002 Competition
inferredcites →https://doi.org/10.1023/a:1006310219368openalex-snapshot
A SAT Solver Using Reconfigurable Hardware and Virtual Logic
inferredcites →https://doi.org/10.1023/a:1008155020711openalex-snapshot
Reconfigurable Computing for Digital Signal Processing: A Survey
inferredcites →https://doi.org/10.1090/dimacs/035/02openalex-snapshot
Algorithms for the satisfiability (SAT) problem: A survey
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/2.839322openalex-snapshot
Reconfigurable accelerators for combinatorial problems
inferredcites →https://doi.org/10.1109/43.766733openalex-snapshot
Using configurable computing to accelerate Boolean satisfiability
inferredcites →https://doi.org/10.1109/92.920826openalex-snapshot
Solving satisfiability problems using reconfigurable computing
inferredcites →https://doi.org/10.1109/92.920833openalex-snapshot
A bitstream reconfigurable FPGA implementation of the WSAT algorithm
inferredcites →https://doi.org/10.1109/dac.1998.724465openalex-snapshot
Using reconfigurable computing techniques to accelerate problems in the CAD domain: a case study with Boolean satisfiability
inferredcites →https://doi.org/10.1109/date.2002.998262openalex-snapshot
BerkMin: A fast and robust SAT-solver
inferredcites →https://doi.org/10.1109/dsd.2001.952124openalex-snapshot
Reconfigurable computing at Xilinx
inferredcites →https://doi.org/10.1109/fccm.2001.3openalex-snapshot
A Configurable Hardware/Software Approach to SAT Solving
inferredcites →https://doi.org/10.1109/fpga.1998.707897openalex-snapshot
Dynamic circuit generation for solving specific problem instances of Boolean satisfiability
inferredcites →https://doi.org/10.1109/fpga.2000.903388openalex-snapshot
A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems
inferredcites →https://doi.org/10.1109/fpga.2002.1106685openalex-snapshot
On implementing a configware/software SAT solver
inferredcites →https://doi.org/10.1109/hicss.1998.649212openalex-snapshot
Solving satisfiability problems using logic synthesis and reconfigurable hardware
inferredcites →https://doi.org/10.1109/hicss.1999.772883openalex-snapshot
Dynamic circuit generation for Boolean satisfiability in an object-oriented design environment
inferredcites →https://doi.org/10.1109/icppw.1999.800085openalex-snapshot
An architecture for solving boolean satisfiability using runtime configurable hardware
inferredcites →https://doi.org/10.1109/mahc.2002.1114865openalex-snapshot
Reconfigurable computer origins: the UCLA fixed-plus-variable (F+V) structure computer
inferredcites →https://doi.org/10.1109/tc.1981.1675757openalex-snapshot
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
inferredcites →https://doi.org/10.1109/tvlsi.2004.825859openalex-snapshot
A software/reconfigurable hardware SAT solver
inferredcites →https://doi.org/10.1145/277044.277098openalex-snapshot
Using reconfigurable computing techniques to accelerate problems in the CAD domain
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/605440.605444openalex-snapshot
Run-time performance optimization of an FPGA-based deduction engine for SAT solvers
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1201/9780203908068.ch4openalex-snapshot
Recon.gurable Computing and Digital Signal Processing
inferredcites →https://doi.org/10.5555/882452.874465openalex-snapshot
A SAT Solver Using Software and Reconfigurable Hardware

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11560548_37openalex-snapshot
FPGA Based Accelerator for 3-SAT Conflict Analysis in SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-0-387-34731-8_23openalex-snapshot
E-learning Tools and Web-resources for Teaching Reconfigurable Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-34749-3_17openalex-snapshot
Intelligent Systems Engineering with Reconfigurable Computing
inferred← citeshttps://doi.org/10.1007/978-1-4419-0944-2_4openalex-snapshot
Accelerating Boolean Satisfiability on a Custom IC
inferred← citeshttps://doi.org/10.1007/978-1-4614-1791-0_8openalex-snapshot
High-Performance Data Processing Over N-ary Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-20721-2_2openalex-snapshot
Architectures of FPGA-Based Hardware Accelerators and Design Techniques
inferred← citeshttps://doi.org/10.1007/978-3-030-20721-2_3openalex-snapshot
Hardware Accelerators for Data Search
inferred← citeshttps://doi.org/10.1007/978-3-030-20721-2_5openalex-snapshot
FPGA-Based Hardware Accelerators for Selected Computational Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-78890-6_13openalex-snapshot
An FPGA/HMC-Based Accelerator for Resolution Proof Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_6openalex-snapshot
Designing an Efficient Hardware Implication Accelerator for SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-662-44616-4_2openalex-snapshot
Devices and Architectures for Evolutionary Hardware
inferred← citeshttps://doi.org/10.1007/978-981-95-8617-2_1openalex-snapshot
More Paradigms of SAT Solvers: Circuit-SAT, FPGA-Based SAT, LLM-Based SAT
inferred← citeshttps://doi.org/10.1007/s11265-018-1435-yopenalex-snapshot
An Accelerator for Resolution Proof Checking based on FPGA and Hybrid Memory Cube Technology
inferred← citeshttps://doi.org/10.1016/b978-012370522-8.50038-8openalex-snapshot
Boolean Satisfiability
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.12.014openalex-snapshot
Hardware accelerated SAT solvers—A survey
inferred← citeshttps://doi.org/10.1016/j.micpro.2004.03.008openalex-snapshot
FPGA-based implementation of recursive algorithms
inferred← citeshttps://doi.org/10.1016/j.micpro.2014.03.003openalex-snapshot
High-performance implementation of regular and easily scalable sorting networks on an FPGA
inferred← citeshttps://doi.org/10.1016/j.sysarc.2007.02.004openalex-snapshot
Static scheduling techniques for dependent tasks on dynamically reconfigurable devices
inferred← citeshttps://doi.org/10.1049/cje.2021.08.001openalex-snapshot
An Parallel FPGA SAT Solver Based on Multi‐Thread and Pipeline
inferred← citeshttps://doi.org/10.1049/iet-cdt:20060221openalex-snapshot
Efficient, scalable hardware engine for Boolean satisfiability and unsatisfiable core extraction
inferred← citeshttps://doi.org/10.1051/itmconf/20246000010openalex-snapshot
Hardware accelerators for processing clusters in binary vectors
inferred← citeshttps://doi.org/10.1063/1.4981999openalex-snapshot
A survey of SAT solver
inferred← citeshttps://doi.org/10.1063/5.0145125openalex-snapshot
Hardware accelerators for solving computationally intensive problems over binary vectors and matrices
inferred← citeshttps://doi.org/10.1109/aiccsa.2007.370934openalex-snapshot
Software/Configware Implementation of Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493521openalex-snapshot
Hardware based algorithm for conflict diagnosis in SAT solver
inferred← citeshttps://doi.org/10.1109/ccece.2006.277452openalex-snapshot
FPGA-Based SAT Solver
inferred← citeshttps://doi.org/10.1109/date.2007.364583openalex-snapshot
A Shift Register based Clause Evaluator for Reconfigurable SAT Solver
inferred← citeshttps://doi.org/10.1109/date.2011.5763199openalex-snapshot
A reconfigurable, pipelined, conflict directed jumping search SAT solver
inferred← citeshttps://doi.org/10.1109/dsd.2013.31openalex-snapshot
An Efficient Hardware Implementation of a SAT Problem Solver on FPGA
inferred← citeshttps://doi.org/10.1109/dsd.2019.00021openalex-snapshot
SAT-Hard: A Learning-Based Hardware SAT-Solver
inferred← citeshttps://doi.org/10.1109/eurocon.2013.6625220openalex-snapshot
Address-based data processing over N-ary trees
inferred← citeshttps://doi.org/10.1109/fccm.2008.36openalex-snapshot
An FPGA Implementation of Explicit-State Model Checking
inferred← citeshttps://doi.org/10.1109/fpga4gpc.2017.8008962openalex-snapshot
An FPGA SAT solver based on enhanced constraint
inferred← citeshttps://doi.org/10.1109/fpl.2005.1515703openalex-snapshot
An FPGA solver for WSAT algorithms
inferred← citeshttps://doi.org/10.1109/fpl.2005.1515768openalex-snapshot
A low-cost scalable pipelined reconfigurable architecture for simulation of digital circuits
inferred← citeshttps://doi.org/10.1109/fpl.2006.311229openalex-snapshot
An FPGA Solver for Large SAT Problems
inferred← citeshttps://doi.org/10.1109/fpl.2007.4380697openalex-snapshot
An FPGA Solver for Very Large SAT Problems
inferred← citeshttps://doi.org/10.1109/fpt.2005.1568527openalex-snapshot
Solving the minimum dominating set problem with instance-specific hardware on FPGAs
inferred← citeshttps://doi.org/10.1109/fpt.2009.5377605openalex-snapshot
The TU Delft sudoku solver on FPGA
inferred← citeshttps://doi.org/10.1109/fpt.2015.7393130openalex-snapshot
QuickDough: A rapid FPGA loop accelerator design framework using soft CGRA overlay
inferred← citeshttps://doi.org/10.1109/icaict.2011.6110989openalex-snapshot
FPGA-based systems in information and communication
inferred← citeshttps://doi.org/10.1109/icaict.2012.6398506openalex-snapshot
Data processing in FPGA-based systems
inferred← citeshttps://doi.org/10.1109/iccad.2013.6691124openalex-snapshot
FPGA acceleration of enhanced boolean constraint propagation for SAT solvers
inferred← citeshttps://doi.org/10.1109/iccad.2015.7372575openalex-snapshot
SAT solving using FPGA-based heterogeneous computing
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240752openalex-snapshot
VeriSAT: the Hardware Design of Modern SAT Solver
inferred← citeshttps://doi.org/10.1109/iccd.2006.4380836openalex-snapshot
An Efficient, Scalable Hardware Engine for Boolean SATisfiability
inferred← citeshttps://doi.org/10.1109/icces.2006.320437openalex-snapshot
A Hardware Accelerator for SAT Solving
inferred← citeshttps://doi.org/10.1109/idt.2010.5724417openalex-snapshot
A novel conflict directed jumping algorithm for hardware-based SAT solvers
inferred← citeshttps://doi.org/10.1109/ieeegcc.2011.5752522openalex-snapshot
A reconfigurable SAT-based automatic test pattern generator
inferred← citeshttps://doi.org/10.1109/jiot.2022.3155606openalex-snapshot
Real-Time Resource Allocation in Passive Optical Network for Energy-Efficient Inference at GPU-Based Network Edge
inferred← citeshttps://doi.org/10.1109/meco.2013.6601319openalex-snapshot
Exploring limits of parallelism in FPGA-based Boolean satisfiability
inferred← citeshttps://doi.org/10.1109/melcon.2014.6820578openalex-snapshot
Hardware/software co-design in extensible processing platforms for combinatorial search algorithms
inferred← citeshttps://doi.org/10.1109/mtv.2009.25openalex-snapshot
A Reconfigurable Five-Stage Pipelined SAT Solver
inferred← citeshttps://doi.org/10.1109/pacrim.2013.6625505openalex-snapshot
Analysis of single-chip hardware support for mobile and embedded applications
inferred← citeshttps://doi.org/10.1109/reconfig.2016.7857150openalex-snapshot
An effective probability distribution SAT solver on reconfigurable hardware
inferred← citeshttps://doi.org/10.1109/tcad.2011.2179037openalex-snapshot
Hardware Acceleration for Constraint Solving for Random Simulation
inferred← citeshttps://doi.org/10.1145/1150343.1150380openalex-snapshot
A fast SAT solver algorithm best suited to reconfigurable hardware
inferred← citeshttps://doi.org/10.1145/1177352.1177354openalex-snapshot
Propositional Satisfiability and Constraint Programming
inferred← citeshttps://doi.org/10.1145/1391469.1391669openalex-snapshot
A practical reconfigurable hardware accelerator for Boolean satisfiability solvers
inferred← citeshttps://doi.org/10.1145/1497561.1497576openalex-snapshot
FPGA-based hardware acceleration for Boolean satisfiability
inferred← citeshttps://doi.org/10.1145/1857927.1857937openalex-snapshot
An Approach for Solving Large SAT Problems on FPGA
inferred← citeshttps://doi.org/10.1145/3174243.3174247openalex-snapshot
ADAM
inferred← citeshttps://doi.org/10.1201/9781420062670.bmattopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1364/aop.475823openalex-snapshot
Coherent SAT solvers: a tutorial
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.8openalex-snapshot
A Hardware Relaxation Paradigm for Solving NP-Hard Problems
inferred← citeshttps://doi.org/10.17760/d20002661openalex-snapshot
Accelerating explicit state model checking on an FPGA
inferred← citeshttps://doi.org/10.22215/etd/2024-16034openalex-snapshot
Hardware-Accelerated SAT Solvers
inferred← citeshttps://doi.org/10.3390/electronics8030333openalex-snapshot
An Effective FPGA Solver on Probability Distribution and Preprocessing
inferred← citeshttps://doi.org/10.4156/jcit.vol8.issue3.71openalex-snapshot
Solving Computationally Intensive Problems in Reconfigurable Hardware:A Case Study
inferred← citeshttps://doi.org/10.5555/1071752.1071781openalex-snapshot
Implementation of recursive search algorithms in reconfigurable hardware
inferred← citeshttps://doi.org/10.5555/1266366.1266400openalex-snapshot
Interactive presentation: A shift register based clause evaluator for reconfigurable SAT solver
inferred← citeshttps://doi.org/10.5555/1998496.1998536openalex-snapshot
Relieving capacity limits on FPGA-based SAT-solvers
inferred← citeshttps://doi.org/10.5555/2561828.2561875openalex-snapshot
FPGA acceleration of enhanced boolean constraint propagation for SAT solvers
inferred← citeshttps://doi.org/10.5555/2840819.2840853openalex-snapshot
SAT Solving using FPGA-based Heterogeneous Computing
inferred← citeshttps://doi.org/10.5755/j01.eee.20.5.7116openalex-snapshot
Fast Matrix Covering in All Programmable Systems-on-Chip
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95294openalex-snapshot
Bounded model checking for asynchronous concurrent systems
inferred← citeshttps://doi.org/10.70675/f3f1f0dbz62f0z44e7z9bedz608c7d549267openalex-snapshot
Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.