Skip to main content
SpringerLink
Log in
Book cover

French School on Theoretical Computer Science

TCS School 1994: Constraint Programming: Basics and Trends pp 39–61Cite as

Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 910))

Abstract

We consider methods for handling constraints over finite domains based on the notion of path consistency. We show that these methods can be easily integrated in the glass-box constraint-solver of the clp(FD) system. Besides the clp(FD) indexical constraints encoding (partial) arc-consistency methods, we introduce new primitive constraints, that we call m-constraints, which encode path-consistency methods. These new constraints increase the constraint-solving power and the extensibility of the clp(FD) language.

This work is an extended and revised version of [9]. It has been carried out while the second author was visiting INRIA-Rocquencourt, France.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Aït-Kaci. Warren's Abstract Machine. The MIT Press, (1991).

    Google Scholar 

  2. A. Aggoun and N. Beldiceanu. Overview of the CHIP Compiler System. In Proc. Eighth Int. Conf. on Logic Programming (ICLP'91), Paris, France, The MIT Press, pp. 775–789 (1991). Also in Constraint Logic Programming: selected research (A. Colmerauer and F. Benhamou eds.), The MIT Press, (1993).

    Google Scholar 

  3. C. Bessière. Arc-consistency and arc-consistency again. Art. Int. 65, pp. 179–190, (1984).

    Google Scholar 

  4. P. Boizumault, Y. Delon, L. Péridy. Solving a Real-life Planning Exams Problem using Constraint Logic Programming. In Constraint Processing-Proc. of the Int. WS at CSAM'93 (M. Meyer ed.), DFKI Research Report 93–39, pp.106–112, August (1993).

    Google Scholar 

  5. A. Colmerauer. An Introduction to Prolog III. ACM Comm., 33(7), pp. 70–90, July (1990).

    Google Scholar 

  6. D. Diaz and Ph. Codognet. A Minimal Extension of the WAM for clp(FD). In Proc. Tenth Int. Conf. on Logic Programming (ICLP'93), Budapest, Hungary, The MIT Press, pp. 774–790 (1993).

    Google Scholar 

  7. Ph. Codognet and D. Diaz. Compiling Constraints in clp(FD). Tech. Rep. INRIA (1993).

    Google Scholar 

  8. Ph. Codognet and D. Diaz. Local Propagation Methods for Solving Boolean Constraints in Constraint Logic Programming. Tech. Rep. INRIA (1993).

    Google Scholar 

  9. Ph. Codognet and G. Nardiello. Path consistency in clp(FD). Proceedings of CCL'94-1st International Conference on Constraint in Computational Logics, Munich, LNCS 845 (J.-P. Jouannaud ed.), Springer-Verlag (1994).

    Google Scholar 

  10. CHIP User's Guide. Version 4.0 Revision A. COSYTEC SA, June 11, France (1993).

    Google Scholar 

  11. M.C. Cooper. An Optimal k-Consistency Algorithm. Art. Int. 41, pp. 89–95, (1989/90).

    Google Scholar 

  12. M. Dincbas, M. Simonis, and P. Van Hentenryck. Solving Large Combinatorial Problems in Constraint Logic Programming. Journal of Logic Programming, 8(1–2), pp. 75–93, (1990).

    Google Scholar 

  13. R. Dechter, I. Meiri and J. Pearl. Temporal constraint networks. Art. Int. 49, pp. 61–95 (1991).

    Google Scholar 

  14. M. Dincbas, P. Van Hentenryck, M. Simonis, A. Aggoun, T. Graf, F. Berthier. The Constraint Logic Programming Language CHIP. In Proc. Int. Conf. on Fifth Generation Computer System (FGCS'88), Tokyo, Japan, December, pp. 693–702 (1988).

    Google Scholar 

  15. E.C. Freuder. Synthesizing constraint expressions. Communications of the ACM, 21, pp. 958–966, (1978).

    Google Scholar 

  16. E.C. Freuder. A Sufficient Condition for Backtrack-Free Search. Journal of the ACM, 29(1), pp. 24–32, (1982).

    Google Scholar 

  17. R.M. Haralick and G.L. Elliott. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Art. Int. 14, pp. 263–313, (1980).

    Google Scholar 

  18. C.-C. Han and C.H. Lee. Comments on Mohr and Henderson's Path Consistency Algorithm. Art. Int. 36, pp. 125–130, (1988).

    Google Scholar 

  19. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. Tech. Rep. 86/73, Monash University, Victoria, Australia, June (1986).

    Google Scholar 

  20. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. 14th ACM Conf. on Priciples of Programming Languages (POPL'87), Munich, January, pp. 111–119 (1987).

    Google Scholar 

  21. J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. J. Logic Programming, to appear, (1994).

    Google Scholar 

  22. J. Jaffar, S. Michaylov, P.J. Stuckey and R.H.C. Yap. The CLP(R) Language and System. ACM Trans. on Prog. Lang. and Systems, vol. 14(3), pp. 339–395, (1992).

    Google Scholar 

  23. V. Kumar. Algorithms for Constraint-Satisfaction Problems: A Survey. AI Magazine, pp. 32–44, Spring (1992).

    Google Scholar 

  24. A.K. Mackworth. Consistency in Network of Relations. AI Journal, 8(1), pp. 99–118, (1977).

    Google Scholar 

  25. A.K. Mackworth. The logic of constraint satisfaction. AI Journal, 58(1–3) (special volume on Constraint Based Reasoning), pp.3–20, (1992).

    Google Scholar 

  26. A.K. Mackworth and E.C. Freuder. The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems. Art. Int. 25, pp. 65–74, (1985).

    Google Scholar 

  27. R. Mohr and T.C. Henderson. Arc and Path Consistency Revisited. Artificial Intelligence, 28, pp. 225–233, (1986).

    Google Scholar 

  28. U. Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Sciences 7, pp. 95–132, (1974).

    Google Scholar 

  29. B.A. Nadel. Constraint Satisfaction Algorithms. Computational Intelligence, 5, pp. 188–224, (1989).

    Google Scholar 

  30. G. Nardiello. The clp(FD)++ system: its Language and Implementation. draft, July, (1994).

    Google Scholar 

  31. W. Older and A. Vellino. Constraint Arithmetic on Real Intervals. In Constraint Logic Programming (F. Benhamou and A. Colmerauer eds.), pp. 175–195, The MIT Press, (1993).

    Google Scholar 

  32. B.M. Smith. How to solve the zebra problem or path-consistency the easy way. Proc. ECAI'92, pp. 36–37, (1992).

    Google Scholar 

  33. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, (1993).

    Google Scholar 

  34. P. van Beek. On the minimality and decomposability of constraint networks. Proc. AAAI'92, pp. 447–452, (1992).

    Google Scholar 

  35. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT Press, (1989).

    Google Scholar 

  36. P. Van Hentenryck and Y. Deville. The Cardinality Operator: A new Logical Connective for Constraint Logic Programming. In Proc. Eighth Int. Conf. on Logic Programming (ICLP'91), The MIT Press, Paris, France, (1991).

    Google Scholar 

  37. P. Van Hentenryck, Y. Deville and C.-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57, pp 291–321, (1992).

    Google Scholar 

  38. P. Van Hentenryck, V.A. Saraswat and Y. Deville. Constraint processing in cc(FD). Draft (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA-Rocquencourt Domaine de Voluceau, 78153, Le Chesnay, France

    Philippe Codognet

  2. Dipartimento di Matematica, Università di Padova, Via Belzoni 7, 35131, Padova, Italy

    Giuseppe Nardiello

Authors
  1. Philippe Codognet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe Nardiello
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Podelski

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Codognet, P., Nardiello, G. (1995). Enhancing the constraint-solving power of clp(FD) by means of path-consistency methods. In: Podelski, A. (eds) Constraint Programming: Basics and Trends. TCS School 1994. Lecture Notes in Computer Science, vol 910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59155-9_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-59155-9_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59155-9

  • Online ISBN: 978-3-540-49200-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation