Using Constraints for Exploring Catalogs

  • François Laburthe
  • Yves Caseau
Conference paper

DOI: 10.1007/978-3-540-45193-8_72

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2833)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • François Laburthe
    • 1
  • Yves Caseau
    • 1
  1. 1.Bouygues e-labSt Quentin en YvelinesFrance

Personalised recommendations