Abstract
Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving formalisms, even distributed ones, by now there seems to be no concurrent programming framework where soft constraints can be handled. In this chapter we show how the classical concurrent constraint (cc) programming framework can work with soft constraints, and we also propose an extension of cc languages which can use soft constraints to prune and direct the search for a solution. We believe that this new programming paradigm, called soft cc (scc), can be also very useful in many web-related scenarios. In fact, the language level allows web agents to express their interaction and negotiation protocols, and also to post their requests in terms of preferences, and the underlying soft constraint solver can find an agreement among the agents even if their requests are incompatible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bistarelli, S. (2004). 8. Soft Concurrent Constraint Programming. In: Semirings for Soft Constraint Solving and Programming. Lecture Notes in Computer Science, vol 2962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25925-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-25925-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21181-5
Online ISBN: 978-3-540-25925-1
eBook Packages: Springer Book Archive