Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Exploiting Constraints for Domain Managing in CLP(FD)

  • Conference paper
  • First Online:
Frontiers of Combining Systems (FroCoS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2309))

Included in the following conference series:

  • 195 Accesses

Abstract

Constraint Logic Programming languages on Finite Domains CLP(FD) provide a declarative framework for dealing with problems in Artificial Intelligence (AI). However, in many applications, domains are not known at the beginning of the computation and must be computed. The domain computation can be time-consuming, since elements can be retrieved through an expensive acquisition process from the outer world. In this paper, we introduce a CLP language that treats domains as first-class objects, and allows the definition of domains through constraints in a CLP(FD) environment. We define operations and properties on variables and domains.

The language can be implemented on top of different CLP systems, exploiting thus different semantics for domains. We state the specifications that the employed system should provide, and we show that two different CLP systems (Conjunto and log) can be effectively used.

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. H. Abelson, G.J. Sussman, and J. Sussman. Structure and Interpretation of Computer Programs. MIT Press, USA, 6 edition, 1985.

    Google Scholar 

  2. R. Barruffi, E. Lamma, P. Mello, and M. Milano. Least commitment on variable binding in presence of incomplete knowledge. In Proceedings of the European Conference on Planning (ECP99), 1999.

    Google Scholar 

  3. M. Carlsson, J. Widén, J. Andersson, S. Andersson, K. Boortz, H. Nilsson, and T. Sjöland. SICStus Prolog user’s manual. Technical Report T91:15, Swedish Institute of Computer Science, June 1995.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. J. Cohen, P. Koiran, and C. Perrin. Meta-level interpretation of CLP(lists). In F. Benhamou and A. Colmerauer, eds., Constraint Logic Programming-Selected Research, pages 457–481, 1993.

    Google Scholar 

  6. R. Cucchiara, M. Gavanelli, E. Lamma, P. Mello, M. Milano, and M. Piccardi. Constraint propagation and value acquisition: why we should do it interactively. In T. Dean, ed., Sixteenth International Joint Conference on Artificial Intelligence, pages 468–477, Stockholm, Sweden, July 31–August 6 1999. Morgan Kaufmann.

    Google Scholar 

  7. R. Cucchiara, M. Gavanelli, E. Lamma, P. Mello, M. Milano, and M. Piccardi. Extending CLP(FD) with interactive data acquisition for 3D visual object recognition. In Proceedings PACLP’99, pages 137–155, 1999.

    Google Scholar 

  8. M.J. Dent and R.E. Mercer. Minimal forward checking. In Proceedings of the Sixth International Conference on Tools with Artificial Intelligence, pages 432–438, 1994.

    Google Scholar 

  9. A. Dovier, C. Piazza, E. Pontelli, and G. Rossi. Sets and constraint logic programming. ACM TOPLAS, 22(5):861–931, 2000.

    Article  Google Scholar 

  10. A. Dovier, A. Policriti, and G. Rossi. Integrating lists, multisets, and sets in a logic programming framework. In F. Baader and K. U. Schulz, eds., Frontiers of Combining Systems: 1st International Workshop, pages 303–320, Munich, Germany, March 1996. Kluwer Academic Publishers.

    Google Scholar 

  11. M. Gavanelli, E. Lamma, P. Mello, and M. Milano. Channelling information through FD domains. Technical report, LIA, DEIS, University of Bologna, 2001.

    Google Scholar 

  12. C. Gervet. Propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1:191–244, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. Jaffar, M.J. Maher, K. Marriott, and P. Stuckey. The semantics of constraint logic programs. Journal of Logic Programming, 37(1–3):1–46, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  14. C.A. Knoblock, S. Minton, J.L. Ambite, M. Muslea, J. Oh, and M. Frank. Mixedinitiative, multi-source information assistants. In Tenth International World Wide Web Conference, pages 697–707, Hong Kong, China, May 1–5 2001. ACM.

    Google Scholar 

  15. B. Legard and E. Legros. Short overview of the CLPS system. In 3rd Int. Symposium on Programming Language Implementation and Logic Programming, PLILP91, LNCS, pages 431–433, Passau, Germany, August 1991. Springer-Verlag.

    Google Scholar 

  16. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.

    Article  MATH  Google Scholar 

  17. D. Mailharro. A classification and constraint-based framework for configuration. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 12:383–397, 1998.

    Article  Google Scholar 

  18. T. Schiex, J.C. Régin, C. Gaspin, and G. Verfaillie. Lazy arc consistency. In Proc. of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, pages 216–221, Menlo Park, August 4–8 1996. AAAI Press / MIT Press.

    Google Scholar 

  19. M. Sergot. A query-the-user facility for logic programming. In P. Degano and E. Sandewall, eds., Integrated Interactive Computing Systems, pages 27–41. North-Holland, 1983.

    Google Scholar 

  20. M. Zweben and M. Eskey. Constraint satisfaction with delayed evaluation. In IJCAI 89, pages 875–880, Detroit, August 20–25 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Ingegneria, University of Ferrara, Via Saragat, 1, 44100, Ferrara, Italy

    Marco Gavanelli & Evelina Lamma

  2. DEIS, University of Bologna, Viale Risorgimento, 2, 40136, Bologna, Italy

    Paola Mello & Michela Milano

Authors
  1. Marco Gavanelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evelina Lamma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paola Mello
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michela Milano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DIST, Università di Genova, Viale Causa 13, 15145, Genova, Italy

    Alessandro Armando

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gavanelli, M., Lamma, E., Mello, P., Milano, M. (2002). Exploiting Constraints for Domain Managing in CLP(FD). In: Armando, A. (eds) Frontiers of Combining Systems. FroCoS 2002. Lecture Notes in Computer Science(), vol 2309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45988-X_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45988-X_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43381-1

  • Online ISBN: 978-3-540-45988-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation