Skip to main content
SpringerLink
Log in

A Compact Encoding of Pseudo-Boolean Constraints into SAT

  • Conference paper
KI 2012: Advances in Artificial Intelligence (KI 2012)

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

Included in the following conference series:

Abstract

Many different encodings for pseudo-Boolean constraints into the Boolean satisfiability problem have been proposed in the past. In this work we present a novel small sized and simple to implement encoding. The encoding maintains generalized arc consistency by unit propagation and results in a formula in conjunctive normal form that is linear in size with respect to the number of input variables. Experimental data confirms the advantages of the encoding over existing ones for most of the relevant pseudo-Boolean instances.

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 72.00
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. Potsdam answer set solving collection, http://potassco.sourceforge.net/

  2. Abío, I., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: BDDs for Pseudo-Boolean Constraints – Revisited. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 61–75. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Apt, K.: Principles of Constraint Programming. Cambridge University Press (2003)

    Google Scholar 

  4. Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: Cardinality Networks and Their Applications. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 167–180. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Bailleux, O., Boufkhad, Y., Roussel, O.: New Encodings of Pseudo-Boolean Constraints into CNF. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 181–194. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Proc. DAC, pp. 317–320 (1999)

    Google Scholar 

  7. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Comm. ACM 5(7), 394–397 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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 

  9. Eén, N., Sörensson, N.: Translating pseudo-boolean constraints into SAT. JSAT 2(1-4), 1–26 (2006)

    MATH  Google Scholar 

  10. Eibach, T., Pilz, E., Völkel, G.: Attacking Bivium Using SAT Solvers. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 63–76. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. 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 

  12. Kaiss, D., Skaba, M., Hanna, Z., Khasidashvili, Z.: Industrial strength SAT-based alignability algorithm for hardware equivalence verification. In: Proc. FMCAD, pp. 20–26 (2007)

    Google Scholar 

  13. Manquinho, V.M., Marques-Silva, J.P.: On using cutting planes in pseudo-Boolean optimization. JSAT 2(1-4), 209–219 (2006)

    MATH  Google Scholar 

  14. Marques-Silva, J.P., Sakallah, K.A.: Grasp: A search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506–521 (1999)

    Article  MathSciNet  Google Scholar 

  15. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proc. DAC, pp. 530–535 (2001)

    Google Scholar 

  16. Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. J. Symb. Comput. 2(3), 293–304 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. Roussel, O., Manquinho, V.: Pseudo-Boolean and Cardinality Constraints, Frontiers in Artificial Intelligence and Applications, vol. 185, ch. 22, pp. 695–733. IOS Press (2009)

    Google Scholar 

  18. Sinz, C.: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827–831. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Sörensson, N., Biere, A.: Minimizing Learned Clauses. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 237–243. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Tseitin, G.S.: On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic 2(115-125), 10–13 (1968)

    Google Scholar 

  21. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: portfolio-based algorithm selection for SAT. J. Artif. Int. Res. 32(1), 565–606 (2008)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Steffen Hölldobler, Norbert Manthey & Peter Steinke

Authors
  1. Steffen Hölldobler
    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

  3. Peter Steinke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Artificial Intelligence, University of Ulm, 89069, Ulm, Germany

    Birte Glimm

  2. Saarland University and German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, 66123, Saarbrücken, Germany

    Antonio Krüger

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hölldobler, S., Manthey, N., Steinke, P. (2012). A Compact Encoding of Pseudo-Boolean Constraints into SAT. In: Glimm, B., Krüger, A. (eds) KI 2012: Advances in Artificial Intelligence. KI 2012. Lecture Notes in Computer Science(), vol 7526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33347-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33347-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33346-0

  • Online ISBN: 978-3-642-33347-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation