skip to main content
research-article

An Approach for Solving Large SAT Problems on FPGA

Published:01 December 2010Publication History
Skip Abstract Section

Abstract

WSAT and its variants are one of the best performing stochastic local search algorithms for the satisfiability (SAT) problem. In this article, we propose an approach for solving large 3-SAT problems on FPGA using a WSAT algorithm. In hardware solvers, it is important to solve large problems efficiently. In WSAT algorithms, an assignment of binary values to the variables that satisfy all clauses is searched by repeatedly choosing a variable in an unsatisfied clause using a heuristic, and flipping its value. In our solver, (1) only the clauses that may be unsatisfied by the flipping are evaluated in parallel to minimize the circuit size, and (2) several independent tries are executed at the same time on the pipelined circuit to achieve high performance. Our FPGA solver can solve larger problems than previous works with less hardware resources, and shows higher performance.

References

  1. Anbulagan, Pham, D. N., Slaney, J., and Sattar, A. 2005. Old resolution meets modern SLS. In Proceedings of the National Conference on Artificial Intelligence (AAAI’05). 354--359. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Hoos, H. H. and Stutzle, T. 1999. Local search algorithms for SAT: An empirical evaluation. J. Autom. Reason. 24, 421--481. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Hoos, H. H. and Tompkins, D. A. D. 2007. Adaptive novelty+. SAT Competition 2007.Google ScholarGoogle Scholar
  4. Kanazawa, K. and Maruyama, T. 2005. An FPGA solver for WSAT algorithms. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL’05). 83--88.Google ScholarGoogle Scholar
  5. Kanazawa, K. and Maruyama, T. 2006a. An FPGA solver for large SAT problems. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL’06). 243--258.Google ScholarGoogle Scholar
  6. Kanazawa, K. and Maruyama, T. 2006b. An FPGA solver for WSAT algorithms. IEICE Trans. Inform. Syst. J89-D, 6, 1173--1181 (in Japanese).Google ScholarGoogle Scholar
  7. Kanazawa, K. and Maruyama, T. 2007a. An FPGA solver for large SAT problems. IEICE Trans. Inform. Syst. J90-D, 10, 2713--2722 (in Japanese).Google ScholarGoogle Scholar
  8. Kanazawa, K. and Maruyama, T. 2007b. An FPGA solver for very large SAT problems. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL’07). 493--496.Google ScholarGoogle Scholar
  9. Leong, P. H. W., Sham, C. W., Wong, W. C., Wong, H. Y., Yuen, W. S., and Leong, M. P. 2001. A bitstream reconfigurable FPGA implementation of the WSAT algorithm. IEEE Trans. VLSI Syst. 9, 1, 197--201. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. McAllester, D., Selman, B., and Kautz, H. 1997. Evidence for invariants in local search. In Proceedings of the National Conference on Artificial Intelligence (AAAI’97). 321--326. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Pham, D. N. and Anbulagan. 2007. Resolution enhanced sls solver: R+adaptnovelty+. SAT Competition 2007.Google ScholarGoogle Scholar
  12. Selman, B., Kautz, H. A., and Cohen, B. 1994. Noise strategies for improving local search. In Proceedings of the National Conference on Artificial Intelligence (AAAI’94). 337--343. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Skliarova, I. and Ferrari, A. B. 2004. Reconfigurable hardware SAT solvers: A survey of systems. IEEE Trans. Comput. 53, 11, 1449--1461. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Yap, R., Wang, S., and Henz, M. 2003. Real-time reconfigurable hardware WSAT variants. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL’03). 488--496.Google ScholarGoogle Scholar

Index Terms

  1. An Approach for Solving Large SAT Problems on FPGA

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Reconfigurable Technology and Systems
      ACM Transactions on Reconfigurable Technology and Systems  Volume 4, Issue 1
      December 2010
      233 pages
      ISSN:1936-7406
      EISSN:1936-7414
      DOI:10.1145/1857927
      Issue’s Table of Contents

      Copyright © 2010 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 December 2010
      • Accepted: 1 October 2009
      • Revised: 1 September 2009
      • Received: 1 June 2009
      Published in trets Volume 4, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Author Tags

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!