Soft concurrent constraint programming

ACM Transactions on Computational Logic

Volumn 7, Issue 3, 2006, Pages 563-589

  Bistarelli, Stefano ^a,b,e,f   Montanari, Ugo ^c   Rossi, Francesca ^d  

^a CNR   (Italy)

^b UNIVERSITY OF CHIETI   (Italy)

^c UNIVERSITY OF PISA   (Italy)

^d UNIVERSITY OF PADOVA   (Italy)

^e Istituto di informatica e telematica del Consiglio nazionale delle ricerche   (Italy)

^f Dipartimento di Scienze   (Italy)

Author keywords

Concurrent constraint programming; Constraints; Soft constraints

Indexed keywords

FUZZY CONTROL; LOGIC PROGRAMMING; NETWORK PROTOCOLS; PROBLEM SOLVING; UNCERTAIN SYSTEMS; WORLD WIDE WEB;

CLASSICAL CONCURRENT CONSTRAINT; CONCURRENT CONSTRAINT PROGRAMMING; MULTIPLE CONSISTENCY LEVELS; SOFT CONSTRAINT;

CONSTRAINT THEORY;

EID: 33748307458     PISSN: 15293785     EISSN: 15293785     Source Type: Journal    
DOI: 10.1145/1149114.1149118     Document Type: Article

References (27)

1. AWDUCHE, D., MALCOLM, J., AGOGBUA, J., O'DELL, M., AND MCMANUS, J. 1999. Rfc2702: Requirements for traffic engineering over MPLS. Tech. rep. Network Working Group.
2. BELLA, G. AND BISTARELLI, S. 2001. Soft constraints for security protocol analysis: Confidentiality. In Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages (PADL'01). Lecture Notes in Computer Science, vol. 1990. Springer, Berlin, Germany, 108-122.
3. BELLA, G. AND BISTARELLI, S. 2002. Confidentiality levels and deliberate/indeliberate protocol attacks. In Proceedings of the 10th Cambridge International Security Protocol Workshop (CISPW2002). Lecture Notes in Computer Science, vol. 2845. Springer, Berlin, Germany, 104-119.
4. BISTARELLI, S. 2001. Soft constraint solving and programming: A general framework. Ph.D. dissertation. Dipartimento di Informatica, Università di Pisa, Pisa, Italy.
5. BISTARELLI, S. AND FOLEY, S. 2003a. Analysis of integrity policies using soft constraints. In Proceedings of the IEEE 4th international Workshop on Policies for Distributed Systems and Networks (POLICY2003). IEEE Computer Society Press, Los Alamitos, CA, 77-80.
6. BISTARELLI, S. AND FOLEY, S. 2003b. A constraint framework for the qualitative analysis of dependability goals: Integrity. In Proceedings of the 22th International Conference on Computer Safety, Reliability and Security (SAFECOMP2003). Lecture Notes in Computer Science, vol. 2788. Springer, Berlin Germany, 130-143.
7. BISTARELLI, S., MONTANARI, U., AND Rossi, F. 1995. Constraint solving over semirings. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI95). Morgan Kaufman, San Francisco, CA, 624-630.
8. BISTARELLI, S., MONTANARI, U., AND ROSSI, F. 1997. Semiring-based constraint solving and optimization. J. Assoc. Comput. Mach. 44, 2, 201-236.
9. BISTARELLI, S., MONTANARI, U., AND ROSSI, F. 2001. Semiring-based constraint logic programming: Syntax and semantics. ACM Trans. Programm. Lang. Syst. 23, 1, 1-29.
10. BOER, F. D. AND PALAMIDESSI, C. 1991. A fully abstract model for concurrent constraint programming. In Proceedings of the Colloquium on Trees in Algebra and Programming (CAAP91). Lecture Notes in Computer Science, vol. 493. Springer, Berlin, Germany, 296-319.
11. CALISTI, M. AND FALTINGS, B. 2000. Distributed constrained agents for allocating service demands in multi-provider networks,. J. Italian Operat. Res. Soc. Special issue on constraint-based problem solving. XXIX, 91.
12. CHEN, S. AND NAHRSTEDT, K. 1998. Distributed QoS routing with imprecise state information. In Proceedings of the 7th IEEE International Conference on Computer, Communications and Networks (ICCCN'98). 614-621.
13. CLARK, D. 1989. Rfc1102: Policy routing in internet protocols. Tech. rep. Network Working Group.
14. DE BOER, F. AND PALAMIDESSI, C. 1994. From concurrent logic programming to concurrent constraint programming. In Advances in Logic Programming Theory. Oxford University Press, Oxford, U.K., 55-113.
15. DE NICOLA, R., FERRARI, G., MONTANARI, U., PUGLIESE, R., AND TUOSTO, E. 2003. A formal basis for reasoning on programmable QoS. In Verification - Theory and Practice, N. Dershowitz, Ed. Lecture Notes in Computer Science, vol. 2772. Springer, Berlin, Germany, 436-479.
16. DUBOIS, D., FARGIER, H., AND PRADE, H. 1993. The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In Proceedings of the IEEE International Conference on Fuzzy Systems. IEEE Computer Society Press, Los Alamitos, CA, 1131-1136.
17. FARGIER, H. AND LANG, J. 1993. Uncertainty in constraint satisfaction problems: A probabilistic approach. In Proceedings of the European Conference on Symbolic and Qualitative Approaches to Reasoning and Uncertainty (ECSQARU). Lecture Notes in Computer Science, vol. 747. Springer, Berlin, Germany, 97-104.
18. FREUDER, E. AND WALLACE, R. 1992. Partial constraint satisfaction. Artific. Intell. 58, 21-70.
19. JAIN, R. AND SUN, W. 2000. QoS/policy/constraintnbased routing. In Carrier IP Telephony 2000 Comprehensive Report. International Engineering Consortium, Chicago, IL.
20. NICOLA, R. D., FERRARI, G. L., AND PUGLIESE, R. 1998. Klaim: A kernel language for agent interaction and mobility. IEEE Trans. Softw. Eng. (Special issue on mobility and network aware computing) 24, 5, 315-330.
21. PLOTKIN, G. 1981. Post-graduate lecture notes in advanced domain theory (incorporating the Pisa lecture notes). Technical rep. Department of Computer Science, University of Edinburgh, Edinbur, Scotland.
22. RUTTKAY, Z. 1994. Fuzzy constraint satisfaction. In Proceedings of the 3rd IEEE International Conference on Fuzzy Systems. 1263-1268.
23. SARASWAT, V. 1993. Concurrent Constraint Programming. MIT Press, Cambridge, MA.
24. SARASWAT, V., RINARD, M., AND PANANGADEN, P. 1991. Semantic foundations of concurrent constraint programming. In Proceedings of the 18th ACM Symposium on Principles of Programming Languages (POPL91). ACM Press, New York, NY, 333-352.
25. SCHIEX, T. 1992. Possibilistic constraint satisfaction problems, or "how to handle soft constraints"? In Proceedings of the 8th Conference of Uncertainty in Artificial Intelligence (UAI92). Morgan Kaufmann, San Francisco, CA, 269-275.
26. SCHIEX, T., FARGIER, H., AND VERFAILLE, G. 1995. Valued constraint satisfaction problems: Hard and easy problems. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI95). Morgan Kaufmann, San Francisco, CA, 631-637.
27. SCOTT, D. 1982. Domains for denotational semantics. In Proceedings of the 9th International Colloquium on Automata, Languages and Programming (ICALP82). Lecture Notes in Computer Science, vol. 140. Springer, Berlin, Germany, 577-613.