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 algorithms, even distributed ones, by now there seems to be no concurrent programming framework where soft constraints can be handled. In this paper 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 very useful in many webrelated 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.
Research supported in part by the the MURST Projects TOSCA and NAPOLI.
Chapter PDF
Similar content being viewed by others
Keywords
- Constraint Satisfaction Problem
- Operational Semantic
- Constraint System
- Soft Constraint
- Classical Constraint
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Awduche, D., Malcolm, J., Agogbua, J., O’Dell, M., McManus, J.: Rfc2702: Requirements for traffic engineering over mpls. Technical report, Network Working Group (1999)
Bella, G., Bistarelli, S.: Sof constraints for security protocol analysis: Confidentiality. In Ramakrishnan, I., ed.: Proc. of PADL 2001, 3rd international symposium on Practical Aspects of Declarative Languages. Volume 1990 of LNCS., Springer-Verlag (2001) 108–122
Bistarelli, S.: Soft Constraint Solving and programming: a general framework. PhD thesis, Dipartimento di Informatica, Università di Pisa, Italy (2001) TD-2/01.
Bistarelli, S., Montanari, U., Rossi, F.: Constraint Solving over Semirings. In: Proc. IJCAI95, San Francisco, CA, USA, Morgan Kaufman (1995)
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Solving and Optimization. Journal of the ACM 44 (1997) 201–236
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Logic Programming: Syntax and Semantics. ACM Transactions on Programming Languages and System (TOPLAS) (2001) To Appear.
Boer, F.D., Palamidessi, C.: A fully abstract model for concurrent constraint programming. In Abramsky, S., Maibaum, T., eds.: Proc. TAPSOFT/CAAP.Volume 493., Springer-Verlag (1991)
Calisti, M., Faltings, B.: Distributed constrained agents for allocating service demands in multi-provider networks,. Journal of the Italian Operational Research Society XXIX (2000) Special Issue on Constraint-Based Problem Solving.
Chen, S., Nahrstedt, K.: Distributed qos routing with imprecise state information. In: Proc. International Conference on Computer, Communications and Networks (ICCCN’98). (1998)
Clark, D.: Rfc1102: Policy routing in internet protocols. Technical report, Network Working Group (1989)
Dubois, D., Fargier, H., Prade, H.: The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In: Proc. IEEE International Conference on Fuzzy Systems, IEEE (1993) 1131–1136
Fargier, H., Lang, J.: Uncertainty in constraint satisfaction problems: a probabilistic approach. In: Proc. European Conference on Symbolic and Qualitative Approaches to Reasoning and Uncertainty (ECSQARU). Volume 747 of LNCS., Springer-Verlag (1993) 97–104
Freuder, E., Wallace, R.: Partial constraint satisfaction. AI Journal 58 (1992)
Jain, R., Sun, W.: QoS/Policy/Constraint-based routing. In: Carrier IP Telephony 2000 Comprehensive Report. International Engineering Consortium (2000) ISBN: 0-933217-75-7.
Ruttkay, Z.: Fuzzy constraint satisfaction. In: Proc. 3rd IEEE International Conference on Fuzzy Systems. (1994) 1263–1268
Saraswat, V.: Concurrent Constraint Programming. MIT Press (1993)
Schiex, T.: Possibilistic constraint satisfaction problems, or “how to handle soft constraints?”. In: Proc. 8th Conf. of Uncertainty in AI. (1992) 269–275
Schiex, T., Fargier, H., Verfaille, G.: Valued Constraint Satisfaction Problems: Hard and Easy Problems. In: Proc. IJCAI95, San Francisco, CA, USA, Morgan Kaufmann (1995) 631–637
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bistarelli, S., Montanari, U., Rossi, F. (2002). Soft Concurrent Constraint Programming. In: Le Métayer, D. (eds) Programming Languages and Systems. ESOP 2002. Lecture Notes in Computer Science, vol 2305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45927-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-45927-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43363-7
Online ISBN: 978-3-540-45927-9
eBook Packages: Springer Book Archive