Reconfigurable architectures: A new vision for optimization problems

  • Y. Hamadi
  • D. Merceron
Session 4
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1330)


GSAT is a greedy local search procedure. It searches for satisfiable instantiations of formulas under conjunctive normal form. Intrinsically incomplete, this algorithm has shown its ability to deal with formulas of large size that are not yet accessible to exhaustive methods. Many problems such as planning, scheduling, vision can efficiently be solved by using the GSAT algorithm. In this study, we give an implementation of GSAT on Field Programmable Gate Arrays (FPGAs) in order to speed-up the resolution of SAT problems. By this implementation, our aim is to solve large SAT problems and to enable real-time resolution for current size problems. The FPGA technology [12] allows users to adapt a generic logic chip to different tasks. In the framework of SAT problems we show how to quickly adapt our chips to efficiently solve satisfiability problems.


Field Programmable Gate Array Conjunctive Normal Form Logic Formula Dynamic Reconfiguration Reconfigurable Hardware 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. R. Cooper and M. J. Swain. Arc consistency: parallelism and domain dependence. Artificial Intelligence, 58:207–235, 1992.Google Scholar
  2. 2.
    Luidgi Dadda. Some schemes for parallel multipliers, volume 19. Alta Frequenza, 1965.Google Scholar
  3. 3.
    James G. Eldredge and Brad L. Hutchings. Rrann: the run time reconfiguration artificial neural network. In Proc of Custom Integrated Circuits Conference, pages 77–80, 1994.Google Scholar
  4. 4.
    Y. Hamadi, C. Bessiere, and J. Quinqueton. Gsat distribution. In Proceedings of the Second International Conference on Multiagent Systems, page 437, 1996.Google Scholar
  5. 5.
    E. Lemoine and D. Merceron. Run time reconfiguration of FPGA for scanning genomic databases. In D. A. Buell and K. L. Pocek, editors, Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 90–98, Napa, CA, April 1995.Google Scholar
  6. 6.
    S. Minton, M.D. Johnson, A.B. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction problems and scheduling problems. Artificial Intelligence, pages 161–205, 1992.Google Scholar
  7. 7.
    A. Newell. Unified theory of cognition. Harvard University Press, 1994.Google Scholar
  8. 8.
    M. Schaffner. Computers formed by the problems rather than problems deformed by the computer. COMCON Digest, pages 259–264, 1972.Google Scholar
  9. 9.
    B. Selman and H. Kautz. Domain-independant extensions to gsat: Solving large structured satisfiability problems. In International Joint Conference on Artificial Intelligence, pages 290–295, 1993.Google Scholar
  10. 10.
    B. Selman, H. Levesque, and D. Mitchell. Hard and easy distributions of sat problems. In Proceedings, Tenth National Conference on Artificial Intelligence, San Jose, CA.Google Scholar
  11. 11.
    B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings, Tenth National Conference on Artificial Intelligence, San Jose, CA, pages 440–446, 1992.Google Scholar
  12. 12.
    Xilinx Inc. The Programmable Gate Array Data Book. Product Briefs, xilinx san jose edition, 1991.Google Scholar
  13. 13.
    M. Yokoo, T. Suyama, and H. Sawada. Solving satisfiability problems using field programmable gate arrays: First results. In Second International Conference on Principles and Practice of Constraint Programming, pages 497–509, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Y. Hamadi
    • 1
  • D. Merceron
    • 1
  1. 1.LIRMM UMR 5506 CNRS-UMIIMontpellier Cedex 5

Personalised recommendations