Skip to main content
SpringerLink
Log in

Hints Revealed

  • Conference paper
  • First Online:
Theory and Applications of Satisfiability Testing -- SAT 2015 (SAT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9340))

Abstract

We propose a notion of hints, clauses that are not necessarily consistent with the input formula. The goal of adding hints is to speed up the SAT solving process. For this purpose, we provide an efficient general mechanism for hint addition and removal. When a hint is determined to be inconsistent, a hint-based partial resolution-graph of an unsatisfiable core is used to reduce the search space. The suggested mechanism is used to boost performance by adding generated hints to the input formula. We describe two specific hint-suggestion methods, one of which increases performance by 30% on satisfiable SAT ’13 competition instances and solves 9 instances not solved by the baseline solver.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. SAT competition (2013). http://satcompetition.org/2013/downloads.shtml

  2. Beame, P., Kautz, H.A., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. CoRR abs/1107.0044 (2011). http://arxiv.org/abs/1107.0044

  3. Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, February 2009

    Google Scholar 

  4. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electr. Notes Theor. Comput. Sci. 89(4), 543–560 (2003). http://dx.doi.org/10.1016/S1571-0661(05)82542–3

    Article  MATH  Google Scholar 

  6. Hyvärinen, A.E.J., Junttila, T., Niemelä, I.: Grid-based SAT solving with iterative partitioning and clause learning. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 385–399. Springer, Heidelberg (2011). http://dx.doi.org/10.1007/978-3-642-23786-7_30

    Chapter  Google Scholar 

  7. Lanti, D., Manthey, N.: Sharing information in parallel search with search space partitioning. In: Nicosia, G., Pardalos, P. (eds.) LION 7. LNCS, vol. 7997, pp. 52–58. Springer, Heidelberg (2013). http://dx.doi.org/10.1007/978-3-642-44973-4_6

    Chapter  Google Scholar 

  8. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC), Las Vegas, NV, pp. 530–535. ACM, June 2001. http://doi.acm.org/10.1145/378239.379017

  9. Nadel, A.: Boosting minimal unsatisfiable core extraction. In: Bloem, R., Sharygina, N. (eds.) Proceedings of 10th International Conference on Formal Methods in Computer-Aided Design (FMCAD), Lugano, Switzerland, pp. 221–229. IEEE, October 2010. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5770953

  10. Nadel, A., Ryvchin, V., Strichman, O.: Efficient MUS extraction with resolution. In: Formal Methods in Computer-Aided Design (FMCAD), Portland, OR, pp. 197–200. IEEE, October 2013. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=6679410

  11. Nadel, A., Ryvchin, V., Strichman, O.: Accelerated deletion-based extraction of minimal unsatisfiable cores. JSAT 9, 27–51 (2014). https://satassociation.org/jsat/index.php/jsat/article/view/116

    MathSciNet  Google Scholar 

  12. Oh, Y., Mneimneh, M.N., Andraus, Z.S., Sakallah, K.A., Markov, I.L.: AMUSE: a minimally-unsatisfiable subformula extractor. In: Malik, S., Fix, L., Kahng, A.B. (eds.) Proceedings of the 41st Design Automation Conference (DAC), San Diego, CA, pp. 518–523. ACM, June 2004. http://doi.acm.org/10.1145/996566.996710

  13. Ryvchin, V.: HaifaMUC. https://www.dropbox.com/s/uhxeps7atrac82d/Haifa-MUC.7z

  14. Ryvchin, V., Strichman, O.: Faster extraction of high-level minimal unsatisfiable cores. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 174–187. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Sakallah, K.A., Simon, L. (eds.): SAT 2011. LNCS, vol. 6695. Springer, Heidelberg (2011)

    MATH  Google Scholar 

  16. Sörensson, N., Biere, A.: Minimizing learned clauses. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 237–243. Springer, Heidelberg (2009). http://dx.doi.org/10.1007/978-3-642-02777-2_23

    Chapter  Google Scholar 

  17. Strichman, O.: Accelerating bounded model checking of safety properties. Formal Methods in System Design 24(1), 5–24 (2004). http://dx.doi.org/10.1023/B:FORM.0000004785.67232.f8

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Design Technology Solutions Group, Intel Corporation, Haifa, Israel

    Jonathan Kalechstain & Vadim Ryvchin

  2. School of Computer Science, Tel Aviv University, Tel Aviv, Israel

    Jonathan Kalechstain & Nachum Dershowitz

Authors
  1. Jonathan Kalechstain
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vadim Ryvchin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nachum Dershowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jonathan Kalechstain .

Editor information

Editors and Affiliations

  1. Algorithms, University of Texas, Austin, Texas, USA

    Marijn Heule

  2. Trusted Systems Research Group, Fort Meade, Texas, USA

    Sean Weaver

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kalechstain, J., Ryvchin, V., Dershowitz, N. (2015). Hints Revealed. In: Heule, M., Weaver, S. (eds) Theory and Applications of Satisfiability Testing -- SAT 2015. SAT 2015. Lecture Notes in Computer Science(), vol 9340. Springer, Cham. https://doi.org/10.1007/978-3-319-24318-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24318-4_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24317-7

  • Online ISBN: 978-3-319-24318-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation