Solving satisfiability problems using reconfigurable computing

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 9, Issue 1, 2001, Pages 109-116

  Suyama, Takayuki ^a,b   Yokoo, Makoto ^a,c   Sawada, Hiroshi ^a,c   Nagoya, Akira ^a,d  

^a IEEE   (Japan)

^b Research and Development Center   (Japan)

^c NTT Communication Science Laboratories   (Japan)

^d NTT Network Innovation Laboratories   (Japan)

Author keywords

Algorithms; Reconfigurable computing; Satisfiability problems; Search

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FIELD PROGRAMMABLE GATE ARRAYS; LOGIC CIRCUITS; LOGIC DESIGN; PERFORMANCE; RESPONSE TIME (COMPUTER SYSTEMS);

CONJUNCTIVE NORMAL FORM; CONSTRAINT SATISFACTION PROBLEM; DAVIS-PUTNAM PROCEDURE; RECONFIGURABLE COMPUTING; SATISFIABILITY PROBLEMS;

PROBLEM SOLVING;

EID: 0035242975     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/92.920826     Document Type: Article

References (25)

1. Solving satisfiability problems using field programmable gate arrays: First results
2. Solving satisfiability problems using logic synthesis and reconfigurable hardware
3. Solving satisfiability problems on FPGAs using experimental unit propagation
4. High-level synthesis design at NTT systems labs
5. The complexity of theorem proving procedures
6. Satisfiability on reconfigurable hardware
7. Reconfigurable architectures: A new vision for optimizing problem
8. Dynamic circuit generation for solving specific problem instances of boolean satisfiability
9. Accelerating Boolean satisfiability with configurable hardware
10. Solving Boolean satisfiability with dynamic hardware configurations
11. A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware
12. A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems
13. A logical framework for depiction and image interpretation
14. A theory of diagnosis from first principles
15. Can a very simple algorithm be efficient for solving the SAT problem?
16. A computing procedure for quantification theory
17. Increasing tree search efficiency for constraint satisfaction problems
18. Heuristics based on unit propagation for satisfiability problems
19. Improvements to propositional satisfiability search algorithms
20. Hard and easy distributions of SAT problem
21. Random generation of test instances with controlled attributes
22. An implicit enumeration algorithm to generate tests generation algorithms