Skip to main content
SpringerLink
Log in

MaxPre: An Extended MaxSAT Preprocessor

  • Conference paper
  • First Online:
Theory and Applications of Satisfiability Testing – SAT 2017 (SAT 2017)

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

Abstract

We describe MaxPre, an open-source preprocessor for (weighted partial) maximum satisfiability (MaxSAT). MaxPre implements both SAT-based and MaxSAT-specific preprocessing techniques, and offers solution reconstruction, cardinality constraint encoding, and an API for tight integration into SAT-based MaxSAT solvers.

Work supported by Academy of Finland (grants 251170 COIN, 276412, and 284591) and DoCS Doctoral School in Computer Science and Research Funds of the University of Helsinki.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Institutional subscriptions

References

  1. Aho, A., Garey, M., Ullman, J.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131–137 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  2. Asín, R., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: Cardinality networks: a theoretical and empirical study. Constraints 16(2), 195–221 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bayardo, R.J., Panda, B.: Fast algorithms for finding extremal sets. In: Proceedings of SDM, pp. 25–34. SIAM/Omnipress (2011)

    Google Scholar 

  4. Belov, A., Järvisalo, M., Marques-Silva, J.: Formula preprocessing in MUS extraction. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 108–123. Springer, Heidelberg (2013). doi:10.1007/978-3-642-36742-7_8

    Chapter  Google Scholar 

  5. Belov, A., Morgado, A., Marques-Silva, J.: SAT-based preprocessing for MaxSAT. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR 2013. LNCS, vol. 8312, pp. 96–111. Springer, Heidelberg (2013). doi:10.1007/978-3-642-45221-5_7

    Chapter  Google Scholar 

  6. Berg, J., Saikko, P., Järvisalo, M.: Improving the effectiveness of SAT-based preprocessing for MaxSAT. In: Proceedings of IJCAI, pp. 239–245. AAAI Press (2015)

    Google Scholar 

  7. Berg, J., Saikko, P., Järvisalo, M.: Re-using auxiliary variables for MaxSAT preprocessing. In: Proceedings of ICTAI, pp. 813–820. IEEE Computer Society (2015)

    Google Scholar 

  8. Berg, J., Saikko, P., Järvisalo, M.: Subsumed label elimination for maximum satisfiability. In: Proceedings of ECAI. Frontiers in Artificial Intelligence and Applications, vol. 285, pp. 630–638. IOS Press (2016)

    Google Scholar 

  9. Brafman, R.: A simplifier for propositional formulas with many binary clauses. IEEE Trans. Syst. Man Cybern. Part B 34(1), 52–59 (2004)

    Article  Google Scholar 

  10. Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233–235 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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). doi:10.1007/11499107_5

    Chapter  Google Scholar 

  12. Gimpel, J.F.: A reduction technique for prime implicant tables. In: Proceedings of SWCT, pp. 183–191. IEEE Computer Society (1964)

    Google Scholar 

  13. Groote, J., Warners, J.: The propositional formula checker HeerHugo. J. Autom. Reasoning 24(1/2), 101–125 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Heule, M.J.H., Järvisalo, M., Biere, A.: Efficient CNF simplification based on binary implication graphs. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 201–215. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21581-0_17

    Chapter  Google Scholar 

  15. 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). doi:10.1007/978-3-642-12002-2_10

    Chapter  Google Scholar 

  16. Järvisalo, M., Heule, M.J.H., Biere, A.: Inprocessing rules. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 355–370. Springer, Heidelberg (2012). doi:10.1007/978-3-642-31365-3_28

    Chapter  Google Scholar 

  17. Korovin, K.: iProver – an instantiation-based theorem prover for first-order logic (system description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS, vol. 5195, pp. 292–298. Springer, Heidelberg (2008). doi:10.1007/978-3-540-71070-7_24

    Chapter  Google Scholar 

  18. Li, C.: Integrating equivalency reasoning into Davis-Putnam procedure. In: Proceedings of AAAI, pp. 291–296 (2000)

    Google Scholar 

  19. 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). doi:10.1007/978-3-642-31612-8_34

    Chapter  Google Scholar 

  20. 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). doi:10.1007/978-3-642-39611-3_14

    Chapter  Google Scholar 

  21. Marinov, M., Nash, N., Gregg, D.: Practical algorithms for finding extremal sets. J. Exp. Algorithmics 21, Article 1.9 (2016)

    Google Scholar 

  22. Saikko, P., Berg, J., Järvisalo, M.: LMHS: a SAT-IP hybrid MaxSAT solver. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 539–546. Springer, Cham (2016). doi:10.1007/978-3-319-40970-2_34

    Google Scholar 

  23. Slavík, P.: A tight analysis of the greedy algorithm for set cover. In: Proceedings of STOC, pp. 435–441. ACM (1996)

    Google Scholar 

  24. Van Gelder, A.: Toward leaner binary-clause reasoning in a satisfiability solver. Ann. Math. Artif. Intell. 43(1), 239–253 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HIIT, Department of Computer Science, University of Helsinki, Helsinki, Finland

    Tuukka Korhonen, Jeremias Berg, Paul Saikko & Matti Järvisalo

Authors
  1. Tuukka Korhonen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeremias Berg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul Saikko
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Matti Järvisalo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matti Järvisalo .

Editor information

Editors and Affiliations

  1. UNSW Sydney, Sydney, New South Wales, Australia

    Serge Gaspers

  2. University of New South Wales , Sydney, New South Wales, Australia

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Korhonen, T., Berg, J., Saikko, P., Järvisalo, M. (2017). MaxPre: An Extended MaxSAT Preprocessor. In: Gaspers, S., Walsh, T. (eds) Theory and Applications of Satisfiability Testing – SAT 2017. SAT 2017. Lecture Notes in Computer Science(), vol 10491. Springer, Cham. https://doi.org/10.1007/978-3-319-66263-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66263-3_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66262-6

  • Online ISBN: 978-3-319-66263-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation