Skip to main content
SpringerLink
Log in

Towards “Propagation = Logic + Control”

  • Conference paper
Logic Programming (ICLP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4079))

Included in the following conference series:

Abstract

Constraint propagation algorithms implement logical inference. For efficiency, it is essential to control whether and in what order basic inference steps are taken. We provide a high-level framework that clearly differentiates between information needed for controlling propagation versus that needed for the logical semantics of complex constraints composed from primitive ones. We argue for the appropriateness of our controlled propagation framework by showing that it captures the underlying principles of manually designed propagation algorithms, such as literal watching for unit clause propagation and the lexicographic ordering constraint. We provide an implementation and benchmark results that demonstrate the practicality and efficiency of our framework.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace [Wal04], pp. 107–122

    Google Scholar 

  2. Bacchus, F., Walsh, T.: Propagating logical combinations of constraints. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proc. of International Joint Conference on Artificial Intelligence IJCAI 2005, pp. 35–40 (2005)

    Google Scholar 

  3. Cheng, B.M.W., Choi, K.M.F., Lee, J.H.-M., Wu, J.C.K.: Increasing constraint propagation by redundant modeling: An experience report. Constraints 4(2), 167–192 (1999)

    Article  MATH  Google Scholar 

  4. Codognet, P., Diaz, D.: Compiling constraints in clp(FD). Journal of Logic Programming 27(3), 185–226 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cheng, K.C.K., Yap, R.H.C.: Constrained decision diagrams. In: Veloso, M.M., Kambhampati, S. (eds.) Proc. of 20th National Conference on Artificial Intelligence AAAI 2005, pp. 366–371. AAAI Press, Menlo Park (2005)

    Google Scholar 

  6. Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global Constraints for Lexicographic Orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 93–108. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Freuder, E.C.: A sufficient condition for backtrack-free search. Journal of the ACM 29(1), 24–32 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  8. Frühwirth, T.: Theory and practice of Constraint Handling Rules. Journal of Logic Programming 37(1-3), 95–138 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Van Hentenryck, P., Deville, Y.: The Cardinality operator: A new logical connective for constraint logic programming. In: Furukawa, K. (ed.) Proc. of 8th International Conference on Logic Programming ICLP 1991, pp. 745–759. MIT Press, Cambridge (1991)

    Google Scholar 

  10. Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. Journal of Logic Programming 19&20, 503–582 (1994)

    Article  MathSciNet  Google Scholar 

  11. Kowalski, R.A.: Algorithm = Logic + Control. Communications of the ACM 22(7), 424–436 (1979)

    Article  MATH  Google Scholar 

  12. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of 38th Design Automation Conference DAC 2001 (2001)

    Google Scholar 

  13. Quimper, C.-G., Walsh, T.: Beyond finite domains: The All Different and Global Cardinality constraints. In: van Beek, P. (ed.)Proc. of 11th International Conference on Principles and Practice of Constraint Programming (CP 2004). LNCS, vol. 3709, pp. 812–816. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Régin, J.-C.: A filtering algorithm for constraints of difference in csps. In: Proc. of 12th National Conference on Artificial Intelligence AAAI 1994, pp. 362–367. AAAI Press, Menlo Park (1994)

    Google Scholar 

  15. Saraswat, V.A.: Concurrent Constraint Programming. MIT Press, Cambridge (1993)

    Google Scholar 

  16. Thiffault, C., Bacchus, F., Walsh, T.: Solving non-clausal formulas with DPLL search. In: Wallace [Wal04], pp. 663–678

    Google Scholar 

  17. Wallace, M. (ed.): CP 2004. LNCS, vol. 3258. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  18. Wallace, M.G., Novello, S., Schimpf, J.: ECLiPSe: A platform for constraint logic programming. ICL Systems Journal 12(1), 159–200 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National ICT Australia, Victoria Research Lab, Melbourne, Australia

    Sebastian Brand

  2. School of Computing, National University of Singapore, Singapore

    Roland H. C. Yap

Authors
  1. Sebastian Brand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland H. C. Yap
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Twente, The Netherlands

    Sandro Etalle

  2. Department of Computer Science, University of Kentucky, 40506, Lexington, KY, USA

    Mirosław Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brand, S., Yap, R.H.C. (2006). Towards “Propagation = Logic + Control”. In: Etalle, S., Truszczyński, M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11799573_10

Download citation

  • DOI: https://doi.org/10.1007/11799573_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36635-5

  • Online ISBN: 978-3-540-36636-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation