Skip to main content
SpringerLink
Log in

An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Pseudo-Boolean (PB) constraints are ubiquitous in Constraint Satisfaction Problems. Encoding such constraints to SAT has proved to be an efficient solving approach. A commonly used technique for encoding PB constraints consists in representing the constraint as a Binary Decision Diagram (BDD), and then encoding this BDD to SAT. A key point in this technique is to obtain small BDD representations to generate small SAT formulas. In many problems, some subsets of the Boolean variables occurring in a PB constraint may also have other constraints imposed on them. In this work we introduce a way to take advantage of those constraints in order to obtain smaller SAT encodings. The main idea is that decision diagrams may be smaller if they avoid to represent truth assignments that are already forbidden by some other constraints. In particular, we present encodings for monotonic decreasing PB constraints, in conjunction with other constraints such as at-most-one, exactly-one and implication chains on subsets of their variables. We provide empirical evidence of the usefulness of this technique to reduce the size of the encodings as well as the solving time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Abío I, Stuckey PJ (2014) Encoding linear constraints into SAT. In: International conference on principles and practice of constraint programming (CP), lecture notes in computer science, vol 8656, pp 75–91

  • Abío I, Nieuwenhuis R, Oliveras A, Rodríguez-Carbonell E, Mayer-Eichberger V (2012) A new look at BDDs for pseudo-Boolean constraints. J Artif Intell Res 45:443–480

    Article  MathSciNet  Google Scholar 

  • Abío I, Mayer-Eichberger V, Stuckey PJ (2015) Encoding linear constraints with implication chains to CNF. In: International conference on principles and practice of constraint programming (CP), lecture notes in computer science, vol 9255, Springer, pp 3–11

  • Abío I, Gange G, Mayer-Eichberger V, Stuckey PJ (2016) On CNF encodings of decision diagrams. In: 13th International conference on integration of AI and OR techniques in constraint programming (CPAIOR), lecture notes in computer science, vol 9676, pp 1–17

  • Bacchus F, Winter J (2003) Effective preprocessing with hyper-resolution and equality reduction. In: International conference on theory and applications of satisfiability testing (SAT), lecture notes in computer science, vol 2919, pp 341–355

  • Bailleux O, Boufkhad Y, Roussel O (2006) A translation of pseudo-boolean constraints to SAT. J Satisf Boolean Model Comput 2:191–200

    MATH  Google Scholar 

  • Bailleux O, Boufkhad Y, Roussel O (2009) New encodings of pseudo-boolean constraints into CNF. In: International conference on theory and applications of satisfiability testing (SAT), lecture notes in computer science, vol 5584, pp 181–194

  • Bofill M, Busquets D, Muñoz V, Villaret M (2013) Reformulation based MaxSAT robustness. Constraints 18(2):202–235

    Article  MathSciNet  Google Scholar 

  • Bofill M, Palahí M, Suy J, Villaret M (2014) Solving intensional weighted CSPs by incremental optimization with BDDs. In: Prodeedings of the 20th international conference on principles and practice of constraint programming, CP2014, pp 207–223. https://doi.org/10.1007/978-3-319-10428-7_17

  • Bofill M, Coll J, Suy J, Villaret M (2016) Solving the multi-mode resource-constrained project scheduling problem with SMT. In: 28th IEEE international conference on tools with artificial intelligence (ICTAI), pp 239–246

  • Bofill M, Coll J, Suy J, Villaret M (2017) Compact MDDs for pseudo-Boolean constraints with at-most-one relations in resource-constrained scheduling problems. In: Proceedings of the twenty-sixth international joint conference on artificial intelligence (IJCAI), pp 555–562

  • Bofill M, Coll J, Suy J, Villaret M (2019) SAT encodings of pseudo-Boolean constraints with at-most-one relations. In: Proceedings of the 16th international conference of integration of constraint programming, artificial intelligence, and operations reserarch (CPAIOR), pp 112–128. https://doi.org/10.1007/978-3-030-19212-9_8

  • Brucker P, Drexl A, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Oper Res 112(1):3–41

    Article  Google Scholar 

  • Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6(1):80–91

    Article  MathSciNet  Google Scholar 

  • De Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284–309

    Article  MathSciNet  Google Scholar 

  • Dutertre B, de Moura L (2006) The Yices SMT solver. Tech. rep., Computer Science Laboratory, SRI International, available at http://yices.csl.sri.com

  • Eén N, Biere A (2005) Effective preprocessing in SAT through variable and clause elimination. In: International conference on theory and applications of satisfiability testing (SAT), lecture notes in computer science, vol 3569, pp 61–75

  • Eén N, Sorensson N (2006) Translating pseudo-boolean constraints into SAT. J Satisf Boolean Model Comput 2:1–26

    MATH  Google Scholar 

  • Hartmann S (2013) Project scheduling with resource capacities and requests varying with time: a case study. Flex Serv Manuf J 25(1–2):74–93

    Article  Google Scholar 

  • Hölldobler S, Manthey N, Steinke P (2012) A compact encoding of pseudo-Boolean constraints into SAT. In: KI 2012: advances in artificial intelligence 35th annual german conference on artificial intelligence, lecture notes in computer science, vol 7526, pp 107–118

  • Hosaka K, Takenaga Y, Yajima S (1994) On the size of ordered binary decision diagrams representing threshold functions. In: 5th International symposium on algorithms and computation (ISAAC), lecture notes in computer science, vol 834, pp 584–592

  • Joshi S, Martins R, Manquinho VM (2015) Generalized totalizer encoding for pseudo-boolean constraints. In: Principles and practice of constraint programming—CP 2015, 21st international conference, LNCS, vol 9255, Springer, pp 200–209

  • Kellerer H, Pferschy U, Pisinger D (2004) Multidimensional knapsack problems. In: Knapsack problems, Springer, Berlin, pp 235–283. https://doi.org/10.1007/978-3-540-24777-7_9

  • Kolisch R, Sprecher A (1997) PSPLIB: a project scheduling problem library. Eur J Oper Res 96(1):205–216

    Article  Google Scholar 

  • Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345–358

    Article  MathSciNet  Google Scholar 

  • Leyton-Brown K, Shoham Y (2006) A test suite for combinatorial auctions. In: Combinatorial auctions, The MIT Press, chap 18, pp 451–478

  • Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326–329

    Article  MathSciNet  Google Scholar 

  • Philipp T, Steinke P (2015) PBLib–a library for encoding pseudo-boolean constraints into CNF. In: International conference on theory and applications of satisfiability testing (SAT), lecture notes in computer science, vol 9340, pp 9–16

  • Pritsker AAB, Waiters LJ, Wlofe PM (1996) Multiproject scheduling with limited resources: a zero-one programming approach. Manag Sci 16:93–108

    Article  Google Scholar 

  • Srinivasan A, Ham T, Malik S, Brayton RK (1990) Algorithms for discrete function manipulation. In: IEEE international conference on computer-aided design (ICCAD), IEEE, pp 92–95

  • Tamura N, Banbara M, Soh T (2013) Compiling pseudo-boolean constraints to SAT with order encoding. In: 25th IEEE international conference on tools with artificial intelligence (ICTAI), pp 1020–1027

  • Van Peteghem V, Vanhoucke M (2014) An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances. Eur J Oper Res 235(1):62–72

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by MINECO/FEDER, UE (grant number TIN2015-66293-R), Ayudas para Contratos Predoctorales 2016, funded by MINECO and co-funded by FSE (grant number BES-2016-076867), and MICINN/FEDER, UE (grant number RTI2018-095609-B-I00).

Author information

Authors and Affiliations

  1. Universitat de Girona, Girona, Spain

    Miquel Bofill, Jordi Coll, Josep Suy & Mateu Villaret

Authors
  1. Miquel Bofill
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jordi Coll
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Josep Suy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mateu Villaret
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jordi Coll.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bofill, M., Coll, J., Suy, J. et al. An MDD-based SAT encoding for pseudo-Boolean constraints with at-most-one relations. Artif Intell Rev 53, 5157–5188 (2020). https://doi.org/10.1007/s10462-020-09817-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-020-09817-6

Keywords

Search

Navigation