Solving satisfiability problems on FPGAs

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

Volumn 1142, Issue , 1996, Pages 136-145

  Suyama, Takayuki ^a   Yokoo, Makoto ^a   Sawada, Hiroshi ^a  

^a NTT Communication Science Laboratories   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); FORMAL LOGIC; HIGH LEVEL LANGUAGES; LOGIC DESIGN; LOGIC SYNTHESIS; PROGRAM COMPILERS; TREES (MATHEMATICS);

FPGA TECHNOLOGY; LOGIC-SYNTHESIS TECHNOLOGY; NEW APPROACHES; PROBLEM INSTANCES; RECONFIGURABLE LOGIC; SATISFIABILITY PROBLEMS; SEARCH TREE SIZE;

RECONFIGURABLE HARDWARE;

EID: 84955583758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61730-2_14     Document Type: Conference Paper

References (11)

1. Brown, S. D., Francis, R. J., Rose, J., and Vranesic, Z. G.: Field-Programmable Gate Arrays, Kluwer Academic Publishers (1992).
2. Camposano, R. and Wolf, W.: High-Level VLSI Synthesis, Kluwer Academic Publishers (1991).
3. 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, pp. 1047-1054 (1993).
4. Mackworth, A. K.: Constraint satisfaction, in Shapiro, S. C., ed., Encyclopedia of Artificial Intelligence, pp. 285-293, Wiley-Interscience Publication, New York (1992), second edition.
5. Cook, S.: The complexity of theorem proving procedures, Proceedings of the 3rd Annual ACM Symposium on the Theory of Computation, pp. 151-158 (1971).
6. Davis, M. and Putnam, H.: A computing procedure for quantification theory, Journal of the ACM, Vol. 7, pp. 201-215 (1960).
7. Mitchell, D., Selman, B., and Levesque, H.: Hard and easy distributions of SAT problem, Proceedinqs of the Tenth National Conference on Artificial Intelliqence, pp. 459-465 (1992).
8. Zycad Corp.: Paradigm RP Concept Silicon User's Guide, Hardware Reference Manual, Software Reference Manual (1994).
9. Crawford, J. M. and Auton, L. D.: Experimental results on the crossover point in satisfiability problems, Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 21-27 (1993).
10. Freeman, J. W.: Improvements to prepositional satisfiability search algorithms, PhD thesis, the University of Pennsylvania (1995).
11. Dubois, O., Andre, P., Boufkhad, Y., and Carlier, J.: SAT versus UNSAT, Proceedings of the DIM ACS Challenge II Workshop (1993).