Skip to main content
SpringerLink
Log in
Book cover

Annual Conference on Artificial Intelligence

KI 2013: KI 2013: Advances in Artificial Intelligence pp 61–73Cite as

Parallel Variable Elimination on CNF Formulas

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8077))

Abstract

Formula simplification is important for the performance of SAT solvers. However, when applied until completion, powerful preprocessing techniques like variable elimination can be very time consuming. Therefore, these techniques are usually used with a resource limit. Although there has been much research on parallel SAT solving, no attention has been given to parallel preprocessing. In this paper we show how the preprocessing techniques subsumption, clause strengthening and variable elimination can be parallelized. For this task either a high-level variable-graph formula partitioning or a fine-grained locking schema can be used. By choosing the latter and enforcing clauses to be ordered, we obtain powerful parallel simplification algorithms. Especially for long preprocessing times, parallelization is beneficial, and helps Minisat to solve 11 % more instances of recent competition benchmarks.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Marques-Silva, J.P., Sakallah, K.A.: Grasp – a new search algorithm for satisfiability. In: Proc. 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, pp. 220–227 (1996)

    Google Scholar 

  2. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Proc. 36th Annual ACM/IEEE Design Automation Conference, DAC 1999, pp. 317–320. ACM, New York (1999)

    Google Scholar 

  3. Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult SAT instances in the presence of symmetry. In: DAC 2002, pp. 731–736 (2002)

    Google Scholar 

  4. Großmann, P., Hölldobler, S., Manthey, N., Nachtigall, K., Opitz, J., Steinke, P.: Solving periodic event scheduling problems with SAT. In: Jiang, H., Ding, W., Ali, M., Wu, X. (eds.) IEA/AIE 2012. LNCS, vol. 7345, pp. 166–175. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proc. 38th Annual Design Automation Conference, DAC 2001, pp. 530–535 (2001)

    Google Scholar 

  6. Ryan, L.O.: Efficient algorithms for clause learning SAT solvers. Master’s thesis, Simon Fraser University, Canada (2004)

    Google Scholar 

  7. Hölldobler, S., Manthey, N., Saptawijaya, A.: Improving resource-unaware SAT solvers. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 519–534. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proc. 21st Int. Joint Conf. on Artifical Intelligence, IJCAI 2009, pp. 399–404 (2009)

    Google Scholar 

  9. Huang, J.: The effect of restarts on the efficiency of clause learning. In: Proc. 20th International Joint Conference on Artifical Intelligence, IJCAI 2007, pp. 2318–2323 (2007)

    Google Scholar 

  10. Belov, A., Järvisalo, M., Marques-Silva, J.: Formula preprocessing in mus extraction. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol. 7795, pp. 108–123. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Nadel, A., Ryvchin, V., Strichman, O.: Preprocessing in incremental sat. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 256–269. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Manthey, N., Heule, M.J.H., Biere, A.: Automated reencoding of boolean formulas. In: Biere, A., Nahir, A., Vos, T. (eds.) HVC 2012. LNCS, vol. 7857, pp. 102–117. Springer, Heidelberg (2013)

    Google Scholar 

  13. Manthey, N.: Coprocessor 2.0: a flexible CNF simplifier. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 436–441. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

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

    Google Scholar 

  15. Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. 3rd Annual ACM Symposium on Theory of Computing, pp. 151–158 (1971)

    Google Scholar 

  16. Hoos, H., Stützle, T.: Stochastic Local Search. Morgan Kaufmann / Elsevier, San Francisco (2005)

    MATH  Google Scholar 

  17. Coffman, E.G., Elphick, M., Shoshani, A.: System deadlocks. ACM Comput. Surv. 3(2), 67–78 (1971)

    Article  MATH  Google Scholar 

  18. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61–75. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Järvisalo, M., Biere, A., Heule, M.: Blocked clause elimination. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 129–144. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Van Gelder, A.: Toward leaner binary-clause reasoning in a satisfiability solver. Annals of Mathematics and Artificial Intelligence 43(1-4), 239–253 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  21. Lynce, I., Marques-Silva, J.: Probing-Based Preprocessing Techniques for Propositional Satisfiability. In: Proc. 15th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2003, pp. 105–110 (2003)

    Google Scholar 

  22. Tseitin, G.S.: On the complexity of derivations in propositional calculus. In: Slisenko, A.O. (ed.) Studies in Constructive Mathematics and Mathematical Logic, pp. 115–125. Consultants Bureau, New York (1970)

    Google Scholar 

  23. Balint, A., Manthey, N.: Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning. In: Pragmatics of SAT (POS 2013) (2013)

    Google Scholar 

  24. Hölldobler, S., Manthey, N., Nguyen, V., Stecklina, J., Steinke, P.: A short overview on modern parallel SAT-solvers. In: Wasito, I., Hasibuan, Z., Suhartanto, H. (eds.) Proc. of the International Conference on Advanced Computer Science and Information Systems, pp. 201–206 (2001) ISBN 978-979-1421-11-9

    Google Scholar 

  25. Martins, R., Manquinho, V., Lynce, I.: An overview of parallel SAT solving. Constraints 17(3), 304–347 (2012)

    Article  MathSciNet  Google Scholar 

  26. Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proc. Sixth Annual ACM Symposium on Theory of Computing, STOC 1974, pp. 47–63 (1974)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Knowledge Representation and Reasoning Group, Technische Universität Dresden, Germany

    Kilian Gebhardt & Norbert Manthey

Authors
  1. Kilian Gebhardt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Norbert Manthey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Business Informatics I, University of Trier, 54286, Trier, Germany

    Ingo J. Timm

  2. Institute for Web Science and Technologies, University of Koblenz, Universitätsstr. 1, 56070, Koblenz, Germany

    Matthias Thimm

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gebhardt, K., Manthey, N. (2013). Parallel Variable Elimination on CNF Formulas. In: Timm, I.J., Thimm, M. (eds) KI 2013: Advances in Artificial Intelligence. KI 2013. Lecture Notes in Computer Science(), vol 8077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40942-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40942-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40941-7

  • Online ISBN: 978-3-642-40942-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation