Skip to main content
SpringerLink
Log in
Book cover

International Conference on Theory and Applications of Satisfiability Testing

SAT 2008: Theory and Applications of Satisfiability Testing – SAT 2008 pp 1–14Cite as

Modelling Max-CSP as Partial Max-SAT

  • Conference paper

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

Abstract

We define a number of original encodings that map Max-CSP instances into partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our encodings on random binary Max-CSP instances. Moreover, we define a new variant of the support encoding from CSP into SAT which produces fewer clauses than the standard support encoding.

This research was funded by MEC research projects TIN2006-15662-C02-02, TIN2007-68005-C04-04 and Acción Integrada HP2005-0147, and FCT research projects SATPot (POSC/EIA/61852/2004) and SHIPs (PTDC/EIA/64164/2006).

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. Alsinet, T., Manyà, F., Planes, J.: Improved exact solver for weighted Max-SAT. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 371–377. Springer, Heidelberg (2005)

    Google Scholar 

  2. Argelich, J., Manyà, F.: Exact Max-SAT solvers for over-constrained problems. Journal of Heuristics 12(4–5), 375–392 (2006)

    Article  MATH  Google Scholar 

  3. Argelich, J., Manyà, F.: Partial Max-SAT solvers with clause learning. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 28–40. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Bessière, C., Hebrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 299–314. Springer, Heidelberg (2004)

    Google Scholar 

  5. Bonet, M.L., Levy, J., Manyà, F.: A complete calculus for Max-SAT. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 240–251. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Bonet, M.L., Levy, J., Manyà, F.: Resolution for Max-SAT. Artificial Intelligence 171(8–9), 240–251 (2007)

    Google Scholar 

  7. Een, N., Sorensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)

    Google Scholar 

  8. Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252–265. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Gavanelli, M.: The log-support encoding of CSP into SAT. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 815–822. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Génisson, R., Jégou, P.: Davis and Putnam were already checking forward. In: Proceedings of the ECAI-1996, pp. 180–184 (1996)

    Google Scholar 

  11. Gent, I.P.: Arc consistency in SAT. In: Proceedings of ECAI-2002, pp. 121–125 (2002)

    Google Scholar 

  12. Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: A new weighted Max-SAT solver. In: Proceedings of SAT-2007 (2007)

    Google Scholar 

  13. Kasif, S.: On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artificial Intelligence 45, 275–286 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  14. Larrosa, J., Heras, F.: Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In: Proceedings of IJCAI-2005, Edinburgh, Scotland, pp. 193–198. Morgan Kaufmann, San Francisco (2005)

    Google Scholar 

  15. Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient max-sat solving. Artificial Intelligence 172(2–3), 204–233 (2008)

    Article  MathSciNet  Google Scholar 

  16. Li, C.M., Manyà, F., Planes, J.: Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 403–414. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Li, C.M., Manyà, F., Planes, J.: Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. In: Proceedings of AAAI-2006, pp. 86–91 (2006)

    Google Scholar 

  18. Li, C.M., Manyà, F., Planes, J.: New inference rules for Max-SAT. Journal of Artificial Intelligence Research 30, 321–359 (2007)

    MATH  Google Scholar 

  19. Marques-Silva, J., Planes, J.: Algorithms for Maximum Satisfiability using Unsatisfiable Cores. In: Proceedings of DATE-2008 (2008)

    Google Scholar 

  20. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: 39th Design Automation Conference (2001)

    Google Scholar 

  21. Pipatsrisawat, K., Darwiche, A.: Clone: Solving weighted max-sat in a reduced search space. In: 20th Australian Joint Conference on Artificial Intelligence, AI-2007, pp. 223–233 (2007)

    Google Scholar 

  22. Ramírez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 605–619. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  23. Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441–456. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Universitat de Lleida, Jaume II, 69, E-25001, Lleida, Spain

    Josep Argelich, Alba Cabiscol & Felip Manyà

  2. IST/INESC-ID, Technical University of Lisbon, Rua Alves Redol 9, 1000-029, Lisboa, Portugal

    Inês Lynce

Authors
  1. Josep Argelich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alba Cabiscol
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Inês Lynce
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Felip Manyà
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans Kleine Büning Xishun Zhao

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Argelich, J., Cabiscol, A., Lynce, I., Manyà, F. (2008). Modelling Max-CSP as Partial Max-SAT. In: Kleine Büning, H., Zhao, X. (eds) Theory and Applications of Satisfiability Testing – SAT 2008. SAT 2008. Lecture Notes in Computer Science, vol 4996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79719-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79719-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79718-0

  • Online ISBN: 978-3-540-79719-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation