Skip to main content
SpringerLink
Log in
Book cover

International Conference on Principles and Practice of Constraint Programming

CP 1998: Principles and Practice of Constraint Programming — CP98 pp 205–219Cite as

Compiling Semiring-based Constraints with clp(FD,S)

  • Conference paper
  • First Online:

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

Abstract

In some recent works, a general framework for finite domains constraint satisfaction has been defined, where classical CSPs, fuzzy CSPs, weighted CSPs, partial CSPs and others can be easily cast. This framework, based on a semiring structure, allows, under certain conditions, to compute arc-consistency. Restricting to that case and integrating semiring-based constraint solving in the Constraint Logic Programming paradigm, we have implemented a generic language, clp(FD,S), for semiring-based constraint satisfaction. In this paper, we describe the kernel of the language: the SFD system and our implementation of clp(FD,S). We also give some performance results on various examples.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. S. Bistarelli, U. Montanari and F. Rossi. Constraint Solving over Semirings. In Proceedings of IJCAI’95, Morgan Kaufman, 1995.

    Google Scholar 

  2. S. Bistarelli, U. Montanari and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of ACM, vol. 44, n. 2, pp. 201–236, March 1997.

    Article  MATH  MathSciNet  Google Scholar 

  3. P. Codognet and D. Diaz. A Minimal Extension of the WAM for clp(FD). In Proceedings of ICLP’93, 10th Int. Conf. on Logic Programming, Budapest, Hungary, MIT Press 1993.

    Google Scholar 

  4. P. Codognet and D. Diaz. Compiling Constraints in clp(FD). Journal of Logic Programming, vol. 27, no. 3, 1996.

    Google Scholar 

  5. Y. Caseau and F. Laburthe. Solving Various Weighted Matching Problems with Constraints. In Proceedings of CP’97, 3rd Int. Conf. on Constraint Programming, Springer Verlag, 1997.

    Google Scholar 

  6. Y. Caseau and F. Laburthe. The Claire documentation. LIENS Report 96-15, Ecole Normale Superieure, Paris, 1995.

    Google Scholar 

  7. CON’FLEX, manuel de l’utilisateur Laboratoire de Biométrie et d’Intelligence Artificielle, INRA, France, 1996

    Google Scholar 

  8. M. Dincbas, H. Simonis, P. Van Hentenryck. Solving the Car-Sequencing Problem In Constraint Logic Programming. In Proceedings of ECAI’88. Munich, West Germany, August 1988.

    Google Scholar 

  9. D. Dubois, H. Fargier, and H. Prade. The calculus of fuzzy restrictions as a basis for exible constraint satisfaction. In Proceedings of IEEE International Conference on Fuzzy Systems. IEEE, 1993.

    Google Scholar 

  10. E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. AI Journal, 58, 1992, pp. 21–70.

    MathSciNet  Google Scholar 

  11. L. Gacℷne. Elements de logique floue. Hermes, 1997.

    Google Scholar 

  12. M. Lema⩼re and L. Lobjois. Bibliothèque d’algorithmes de résolution de problémes et d’optimisation sous contraintes. CERT, FRANCE, 1997.

    Google Scholar 

  13. A. K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence 8 (1977), pp 99–118.

    Article  MATH  Google Scholar 

  14. A. K. Mackworth. Constraint satisfaction. In Stuart C. Shapiro, editor, Encyclopedia of AI (second edition), volume 1, pages 285–293. John Wiley & Sons, 1992.

    Google Scholar 

  15. U. Montanari. Networks of constraints: Fundamental properties and application to picture processing. Information Science, 7, 1974.

    Google Scholar 

  16. A. Rosenfeld, R.A. Hummel, and S.W. Zucker. Scene labelling by relaxation operations. IEEE Transactions on Systems, Man, and Cybernetics, 6(6), 1976.

    Google Scholar 

  17. Z. Ruttkay. Fuzzy constraint satisfaction. In Proceedings of 3rd International Conference on Fuzzy Systems, 1994.

    Google Scholar 

  18. T. Schiex, H. Fargier, and G. Verfaillie. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proceedings of IJCAI’95. Morgan Kaufmann, 1995.

    Google Scholar 

  19. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. L. A. Zadeh. Calculus of fuzzy restrictions. in K. Tanaka, L.A. Zadeh, K.S Fu and M. Shimura editors, Fuzzy sets and their applications to cognitive and decision processes. Academic Press, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA-Rocquencourt, BP 105, 78153, Le Chesnay, France

    Yan Georget

  2. SONY Computer Science Laboratory, 6, rue Amyot, 75 005, Paris, France

    Philippe Codognet

Authors
  1. Yan Georget
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe Codognet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Information Technology, Griffith University, Nathan, Queensland, 4111, Australia

    Michael Maher

  2. ILOG S.A., 9, rue de Verdun, BP 85, F-94253, Gentilly Cedex, France

    Jean-Francois Puget

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Georget, Y., Codognet, P. (1998). Compiling Semiring-based Constraints with clp(FD,S). In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-49481-2_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65224-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation