Soft concurrent constraint programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2305, Issue , 2002, Pages 53-67

  Bistarelli, Stefano ^a   Montanari, Ugo ^b   Rossi, Francesca ^c  

^a CNR   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; INTERNET PROTOCOLS; PETROLEUM REFINING;

CONCURRENT CONSTRAINT; CONCURRENT CONSTRAINT PROGRAMMING; CONCURRENT PROGRAMMING; CONSISTENCY LEVEL; LANGUAGE LEVELS; NEGOTIATION PROTOCOL; PROGRAMMING FRAMEWORK; PROGRAMMING PARADIGMS; SOFT CONSTRAINT;

CONSTRAINT THEORY;

EID: 84948412454     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45927-8_5     Document Type: Article

References (18)

1. [1] Awduche, D., Malcolm, J., Agogbua, J., O’Dell, M., McManus, J.: Rfc2702: Requirements for traffic engineering over mpls. Technical report, Network Working Group (1999)
2. [2] 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
3. [3] Bistarelli, S.: Soft Constraint Solving and programming: a general framework. PhD thesis, Dipartimento di Informatica, Universit`a di Pisa, Italy (2001) TD-2/01. 53, 56
4. [4] Bistarelli, S., Montanari, U., Rossi, F.: Constraint Solving over Semirings. In: Proc. IJCAI95, San Francisco, CA, USA, Morgan Kaufman (1995) 54
5. [5] Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Solving and Optimization. Journal of the ACM 44 (1997) 201-236
6. 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.
7. [7] 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)
8. [8] 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.
9. Chen, S., Nahrstedt, K.: Distributed qos routing with imprecise state information. In: Proc. International Conference on Computer, Communications and Networks (ICCCN’98). (1998)
10. [10] Clark, D.: Rfc1102: Policy routing in internet protocols. Technical report, Network Working Group (1989)
11. [11] 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
12. [12] 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
13. [13] Freuder, E., Wallace, R.: Partial constraint satisfaction. AI Journal 58 (1992)
14. [14] 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.
15. [15] Ruttkay, Z.: Fuzzy constraint satisfaction. In: Proc. 3rd IEEE International Conference on Fuzzy Systems. (1994) 1263-1268
16. [16] Saraswat, V.: Concurrent Constraint Programming. MIT Press (1993)
17. [17] Schiex, T.: Possibilistic constraint satisfaction problems, or “how to handle soft constraints?”. In: Proc. 8th Conf. of Uncertainty in AI. (1992) 269-275
18. [18] 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