IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v184y2011i1p209-23110.1007-s10479-009-0680-7.html
   My bibliography  Save this article

Leveraging belief propagation, backtrack search, and statistics for model counting

Author

Listed:
  • Lukas Kroc
  • Ashish Sabharwal
  • Bart Selman

Abstract

We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as either lower or upper bounds with different trade-offs between efficiency, bound quality, and correctness guarantee. For lower bounds, we use a recent framework for probabilistic correctness guarantees, and exploit message passing techniques for marginal probability estimation, namely, variations of the Belief Propagation (BP) algorithm. Our results suggest that BP provides useful information even on structured, loopy formulas. For upper bounds, we perform multiple runs of the MiniSat SAT solver with a minor modification, and obtain statistical bounds on the model count based on the observation that the distribution of a certain quantity of interest is often very close to the normal distribution. Our experiments demonstrate that our model counters based on these two ideas, BPCount and MiniCount, can provide very good bounds in time significantly less than alternative approaches. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Lukas Kroc & Ashish Sabharwal & Bart Selman, 2011. "Leveraging belief propagation, backtrack search, and statistics for model counting," Annals of Operations Research, Springer, vol. 184(1), pages 209-231, April.
    • Handle: RePEc:spr:annopr:v:184:y:2011:i:1:p:209-231:10.1007/s10479-009-0680-7
    DOI: 10.1007/s10479-009-0680-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0680-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-009-0680-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:184:y:2011:i:1:p:209-231:10.1007/s10479-009-0680-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.