skip to main content
10.1145/1774088.1774524acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
poster

Local lemma: a new strategy of pruning in SAT solvers

Authors Info & Claims
Published:22 March 2010Publication History

ABSTRACT

This paper proposes a search tree pruning strategy for SAT solving. It is called Local Lemma, because it generates lemmas from explored subtrees and these lemmas are valid only in a part of the search tree. The paper explains the basic principle of the strategy, illustrates it with an example, and presents some experimental results.

References

  1. D. Babic, J. Bingham, and A. J. Hu. Efficient SAT solving: Beyond supercubes. In Proc. of the 42nd Design Automation Conference, pages 744--749, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. Eén and N. Sörensson. An extensible SAT-solver. In Proc. of SAT'03, pages 502--518, 2003.Google ScholarGoogle Scholar
  3. E. Goldberg, M. R. Prasad, and R. K. Brayton. Using problem symmetry in search based satisfiability algorithms. In Proc. of the Conference on Design, Automation, and Test in Europe, pages 134--142, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. P. Marques-Silva and K. A. Sakallah. GRASP - a new search algorithm for satisfiability. In IEEE International Conf. on Tools with Artificial Intelligence, 1996.Google ScholarGoogle ScholarCross RefCross Ref

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
  • Published in

    cover image ACM Conferences
    SAC '10: Proceedings of the 2010 ACM Symposium on Applied Computing
    March 2010
    2712 pages
    ISBN:9781605586397
    DOI:10.1145/1774088

    Copyright © 2010 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 22 March 2010

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • poster

    Acceptance Rates

    SAC '10 Paper Acceptance Rate364of1,353submissions,27%Overall Acceptance Rate1,650of6,669submissions,25%
  • Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader