Solving satisfiability problems using field programmable gate arrays: First results

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

Volumn 1118, Issue , 1996, Pages 491-509

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

^a NTT Communication Science Laboratories   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957874566     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_96     Document Type: Conference Paper

References (16)

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 Pubfishers (1991).
3. Cook, S.: The complexity of theorem proving procedures, Proceedings of the 3rd Annual ACM Symposium on the Theory of Computation (1971) 151-158
4. 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 (1993) 21-27
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.: SAT versus UNSAT, in Johnson, D. S. and Trick, M. A. eds., Proceedings of the Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1993)
7. Freeman, J.W.: Improvements to propositional satisfiability search algorithms, PhD thesis, the University of Pennsylvania (1995)
8. Haralick, R. and Elliot, G. L.: Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, Vol. 14, (1980) 263-313
9. Mackworth, A. K.: Constraint satisfaction, in Shapiro, S. C. ed., Encyclopedia of Artificial Intelligence, Wiley-Interscience Publication, New York (1992) 285-293, second edition
10. Mitchell, D., Selman, B., and Levesque, H.: Hard and easy distributions of SAT problem, Proceedings of the Tenth National Conference on Artificial Intelligence (1992) 459-465
11. 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).
12. Morris, P.: The breakout method for escaping from local minima, Proceedings of the Eleventh National Conference on Artificial Intelligence (1993) 40-45
13. Reiter, R.: A theory of diagnosis from first principles, Artificial Intelligence, Vol. 32, No. 1, (1987) 57-95
14. Reiter, R. and Mackworth, A.: A logical framework for depiction and image interpretation, Artificial Intelligence, Vol. 41, No. 2, (1989) 125-155
15. Selman, B., Levesque, H., and Mitchell, D.: A new method for solving hard satisfiability problems, Proceedings of the Tenth National Conference on Artificial Intelligence (1992) 440-446
16. Zycad Corp.: Paradigm RP Concept Silicon User's Guide, Hardware Reference Manual, Software Reference Manual (1994).