Skip to main content

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

Abstract

Searching objects within a catalog is a problem of increasing importance, as the general public has access to increasing volumes of data.

Constraint programming has addressed the case of searching databases of complex products that can be customized and build from components, through constraint-based configurators. We address the issue of searching objects within catalogs of simpler items for which no logic description is available. We propose to embed constraint technology in a search assistant supporting dynamic and concise dialogs based on the exchange of constraint formulations between the client and the server. At each iteration, the server analyses the data available in the catalog, computes abstractions, cluster decompositions and relaxations in order to provide the user with alternative for either explicitly focusing the search (adding constraints to the user’s wish) or enlarging it (relaxing, to some extent, a subset of the user’s constraints).

This cooperative system is currently used for Intranets, customer relationship management systems and e-commerce websites.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cousot, P., Cousot, R.: Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: POPL (1977)

    Google Scholar 

  2. Gaasterland, T., Godfrey, P., Mincker, J.: An overview of cooperative answering. Journal of Intelligent Information Systems 1(2), 123–157 (1992)

    Article  Google Scholar 

  3. Godin, R., Missaoui, R., April, A.: Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods. International Journal of Man-Machine Studies 38, 747–767 (1998)

    Article  Google Scholar 

  4. Laburthe, F., Caseau, Y.: On the use of constraints for exploring catalogs Bouygues research report 2003-01 (2003)

    Google Scholar 

  5. Motro, A.: Intensional answers to database queries. IEEE transactions on Knowledge and Data Engineering 6(3), 444–454 (1994)

    Article  Google Scholar 

  6. Ozawa, J., Yamada, K.: Discovery of Global Knowledge in a database for cooperative answering. In: Proc. IEEE Int. Conference on fuzzy systems, pp. 849–854 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laburthe, F., Caseau, Y. (2003). Using Constraints for Exploring Catalogs. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45193-8_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20202-8

  • Online ISBN: 978-3-540-45193-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics