Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains

  • Thom Frühwirth
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3978)

Abstract

We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches, the implementation is short and concise without giving up on the best known worst case time complexity. It is incremental and concurrent by nature of CHR. It is provably correct and confluent. It is independent of the underlying constraint system, and therefore not restricted to finite domains. We have found a direct recursive decomposition of the problem. We also show completeness of constraint propagation, i.e. that all possible logical consequences of the constraint are generated by the implementation. Finally, we report about some practical implementation experiments.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abdennadher, S.: Operational semantics and confluence of constraint propagation rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, Springer, Heidelberg (1997)Google Scholar
  2. 2.
    Abdennadher, S., Frühwirth, T., Meuss, H.: Confluence and semantics of constraint simplification rules. Constraints Journal, Special Issue on the 2nd International Conference on Principles and Practice of Constraint Programming 4(2), 133–165 (1999)MATHGoogle Scholar
  3. 3.
    Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)CrossRefMATHGoogle Scholar
  4. 4.
    Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107–122. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Carlsson, M., Beldiceanu, N.: Revisiting the lexicographic ordering constraint. Technical Report T2002-17, Swedish Institute of Computer Science (2002)Google Scholar
  6. 6.
    Carlsson, M., Beldiceanu, N.: From constraints to finite automata to filtering algorithms. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 94–108. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Fargier, H., Lang, J., Schiex, T.: Selecting preferred solutions in fuzzy constraint satisfaction problems. In: 1st European Congress on Fuzzy and Intelligent Technologies, EUFIT (1993)Google Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Frühwirth, T.: Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic Programming. Journal of Logic Programming 37(1–3), 95–138 (1998)CrossRefMATHGoogle Scholar
  10. 10.
    Frühwirth, T.: As time goes by: Automatic complexity analysis of simplification rules. In: 8th International Conference on Principles of Knowledge Representation and Reasoning, Toulouse, France (2002)Google Scholar
  11. 11.
    Frühwirth, T.: Parallelizing union-find in constraint handling rules using confluence analysis. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 113–127. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Frühwirth, T.: Complete propagation rules for lexicographic order constraints over arbitrary domains. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS, vol. 3978, pp. 14–28. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    Frühwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer, Heidelberg (2003)CrossRefMATHGoogle Scholar
  14. 14.
    Hnich, B., Kiziltan, Z., Walsh, T.: Combining symmetry breaking with other constraints: Lexicographic ordering with sums. In: AMAI 2004 Eighth International Symposium on Artificial Intelligence And Mathematics (2004)Google Scholar
  15. 15.
    Schrijvers, T., Demoen, B., Duck, G., Stuckey, P., Frühwirth, T.: Automatic implication checking for chr constraints. In: 6th International Workshop on Rule-Based Programming, January 2006. Electronic Notes in Theoretical Computer Science, vol. 147, pp. 93–111 (2006)Google Scholar
  16. 16.
    Schrijvers, T., Frühwirth, T.: CHR Website (2006), www.cs.kuleuven.ac.be/~dtai/projects/CHR/
  17. 17.
    Sneyers, J., Schrijvers, T., Demoen, B.: The Computational Power and Complexity of Constraint Handling Rules. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, Springer, Heidelberg (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Thom Frühwirth
    • 1
  1. 1.Faculty of Computer ScienceUniversity of UlmGermany

Personalised recommendations