Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Constraint Satisfaction for Modelling Scalable Electronic Catalogs

  • Chapter
  • First Online:
Agent Mediated Electronic Commerce

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

Abstract

Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made more useful by integrating problem-solving capabilities into the information systems. This poses the challenge of scalability: when hundreds of users access a server at the same time, it is important to avoid excessive computational load.

We present the concept of smart clients: lightweight problem-solving agents based on constraint satisfaction which can carry out the computation - and communication-intensive tasks on the user’s computer. We present an example of an air travel planning system based on this technology.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Berthe Y. Choueiry. Abstraction Methods for Resource Allocation. PhD thesis, Swiss Federal Institute of Technology in Lausanne, 1994.

    Google Scholar 

  2. FIPA. Foundation of Intelligent Physical Agents. http://www.fipa.org, 1998.

  3. Mark Fox. Constraint-Directed Search: A Case Study of Job-Shop Scheduling. Morgan Kaufmann Publishers, Inc., Pitman, London, 1987.

    MATH  Google Scholar 

  4. Eugene C. Freuder and Richard J. Wallace. Partial Constraint Satisfaction. Artificial Intelligence, 58(1):21–70, 1992.

    Article  MathSciNet  Google Scholar 

  5. Jango. Excite Product Finder. http://www.jango.com, 1998.

  6. Grzegorz Kondrak and Peter van Beek. A Theoretical Evaluation of Selected Backtracking Algorithms. Artificial Intelligence, 89:365–387, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  7. G. Linden, S. Hanks, and N. Lesh. Interactive Assessment of User Preference Models: The Automated Travel Assistant. In Proceedings of Sixth International Conference on User Modeling, 1997.

    Google Scholar 

  8. Alan K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8:99–118, 1977.

    Article  MATH  Google Scholar 

  9. A. Sathi and M. S. Fox. Constraint-Directed Negotiation of Resource Allocations. In L. Gasser and M. Huhns, editors, Distributed Artificial Intelligence Volume II, pages 163–194. Pitman Publishing: London and Morgan Kaufmann: San Mateo, CA, 1989.

    Google Scholar 

  10. Daniel Sabin and Eugene C. Freuder. Configuration as Composite Constraint Satisfaction. In Proceedings of the Artificial Intelligence and Manufacturing Research Planning Workshop, pages 153–161, 1996.

    Google Scholar 

  11. Felix Freyman Sanjay Mittal. Towards a generic model of configuration tasks. pages 1395–1401, 1989.

    Google Scholar 

  12. Mark Stefik. Planning with constraints (MOLGEN: Part 1). Artificial Intelligence, 16(2):111–140, 1981.

    Article  Google Scholar 

  13. Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, London, UK, 1993.

    Google Scholar 

  14. Peter van Beek. CSPLib: a CSP library written in C language. ftp://ftp.cs.ualberta.ca/pub/vanbeek/software, 1995.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Torrens, M., Faltings, B. (2001). Constraint Satisfaction for Modelling Scalable Electronic Catalogs. In: Dignum, F., Sierra, C. (eds) Agent Mediated Electronic Commerce. Lecture Notes in Computer Science(), vol 1991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44682-6_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-44682-6_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41671-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics