Solving satisfiability problems on FPGAs using experimental unit propagation

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

Volumn 1713, Issue , 1999, Pages 434-445

  Suyama, Takayuki ^a   Yokoo, Makoto ^a   Nagoya, Akira ^a  

^a NTT Communication Science Laboratories   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLOCKS; COMPUTATION THEORY; COMPUTER CIRCUITS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); FORMAL LOGIC; LOGIC CIRCUITS; RECONFIGURABLE ARCHITECTURES; RECONFIGURABLE HARDWARE;

ALGORITHM DESIGN; CIRCUIT IMPLEMENTATION; HARDWARE RESOURCES; INNOVATIVE APPROACHES; PROBLEM INSTANCES; RECONFIGURABLE COMPUTING; SATISFIABILITY PROBLEMS; UNIT PROPAGATION;

PROBLEM SOLVING;

EID: 84957367729     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_31     Document Type: Conference Paper

References (18)

1. Abramovici, M. and Saab, D.: Satisfiablilty on Reconfigurable Hardware, International Workshop on Field Programmable Logic and Applications (1997) 448–456
2. Asahiro, Y., Iwama, K., and Miyano, E.: Random generation of test instances with controlled attributes, Proceedings of the DIMACS Challenge II Workshop (1993)
3. Brown, S. D., Francis, R. J., Rose, J., and Vranesic, Z. G.: Field-Programmable Gate Arrays, Kluwer Academic Publishers (1992)
4. Camposano, R. and Wolf, W.: High-level VLSI synthesis, Kluwer Academic (1991)
5. Davis, M. and Putnam, H.: A computing procedure for quantification theory, Journal of the ACM, Vol. 7, (1960) 201–215
6. Dubois, O., Andre, P., Boufkhad, Y., and Carlier, J.: Can a very simple algorithm be efficient for solving the SAT problem?, Proc. of the DIMACS Challenge II Workshop (1993)
7. Freeman, J.W.: Improvements to propositional satisfiability search algorithms, PhD thesis, the University of Pennsylvania (1995)
8. Hamadi, Y. and Merceron, D.: Reconfigurable Architectures: A New Vision for Optimizing Problem, Proc. of Third International Conference on Principles and Practice on Constraint Programming (CP’97) (1997) 209–221
9. Li, C. M. and Anbulagan,: Heuristics Based on Unit propagation for Satisfiability Problems, Proc. of 15th International Joint Conference on Artificial Intelligence (1997) 366–371
10. Mackworth, A. K.: Encyclopedia of Artificial Intelligence, Wiley-Interscience Publication (1992)
11. Mitchell, D., Selman, B., and Levesque, H.: Hard and easy distributions of SAT problem, Proc. of the Tenth National Conference on Artificial Intelligence (1992) 459–465
12. Nakamura, Y., Oguri, K., Nagoya, A., Yukishita, M., and Nomura, R.: High-level synthesis design at NTT systems labs., IEICE Trans. Inf & Syst., Vol. E76-D, No. 9, (1993) 1047–1054
13. Rashid, A., Leonard, J., and Mangione-Smith, W. H.: Dynamic Circuit Generation for Solving Specific Problem Instances of Boolean Satisfiability, Proc. of IEEE Symposium on Field-Programmable Custom Computing Machines (1998) 196–204
14. Reiter, R.: A theory of diagnosis from first principles, Artificial Intelligence 32(1): (1987) 57–95
15. Reiter, R. and Mackworth, A.: A logical framework for depiction and image interpretation, Artificial Intelligence 41(2): (1989) 125–155
16. Suyama, T., Yokoo, M., and Sawada, H.: Solving Satisfiability Problems Using Logic Synthesis and Reconfigurable Hardware, Proc. of the 31st Annual Hawaii International Conference on System Sciences Vol. VII (1998) 179–186
17. Yokoo, M., Suyama, T., and Sawada, H.: Solving satisfiability problems using field programmable gate arrays: First results, Proc. of the Second International Conference on Principles and Practice of Constraint Programming, Springer-Verlag (1996) 497–509
18. Zhong, P., Martonosi, M., Ashar, P., and Malik, S.: Accelerating Boolean Satisfiability with Configurable Hardware, Proc. of Symposium on Field-Programmable Custom Computing Machines (1998) 186–195