Semirings for soft constraint solving and programming

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

Volumn 2962, Issue , 2004, Pages

  Bistarelli, Stefano ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 29244468339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (196)

1. M. Abadi. Secrecy by typing in security protocols. In Proc. 3rd International Symposium on Theoretical Aspects of Computer Software (TACS97), volume 1281 of Lecture Notes in Computer Science (LNCS), pages 611-638. Springer, 1997.
2. M. Abadi. Secrecy by typing in security protocols. Journal of the ACM (JACM), 46(5):749-786, 1999.
3. M. Abadi and A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proc. 4th ACM Conference on Computer and Communications Security (CCC'97), pages 36-47. ACM, 1997.
4. M. Abadi and R.M. Needham. Prudent engineering practice for cryptographic protocols. IEEE Transactions on Software Engineering (T-SE), 22(1):6-15, 1996.
5. A. Aggoun and N. Beldiceanu. Overview of the chip compiler system. In Constraint Logic Programming: Selected Research. MIT Press, 1993.
6. M.F.C. Allais. Traité d'économie pure. Clément- Juglar, 1971. orig. 1943: À La Recherche d'une Discipline Économique.
7. R.M. Amadio and W. Charatonik. On name generation and set-based analysis in dolev-yao model. Research Report 4379, INRIA, 2002.
8. R. Anderson. Why cryptosystems fail. In Proc. 1st ACM Conference on Computer and Communications Security (CCC'93), pages 217-227. ACM, 1993.
9. K.R. Apt. The essence of constraint propagation. CWI Quarterly, 11(2-3):215-248, 1998.
10. K.R. Apt. The essence of Constraint Propagation. Theoretical Computer Science, 221(1-2):179-210, 1999.
11. K.R. Apt. The Rough Guide to Constraint Propagation (corrected version). In Proc. 5th International Conference on Principles and Practice of Constraint Programming (CP99), volume 1713 of Lecture Notes in Computer Science (LNCS), pages 1-23. Springer, 1999. invited lecture.
12. K.R. Apt. The role of commutativity in constraint propagation algorithms. ACM Transactions on Programming Languages and Systems (TOPLAS), 22(6):1002-1036, 2000.
13. D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus. Rfc2702: Requirements for traffic engineering over mpls. Technical report, Network Working Group, 1999.
14. G. Baues, P. Kay, and P. Charlier. Constraint based resource allocation for airline crew management. In Proc. Aviation, Transport and Travel Informations Systems Conference/Exhibition (ATTIS'94), 1994.
15. C. Beierle, E. Börger, I. Durdanivich, U. Glässer, and E. Riccobene. Refining abstract state machine specifications of the steam boiler control to well documented executable code. In Formal Methods for Industrial Applications: The Steam-Boiler Case Study, volume 1165 of Lecture Notes in Computer Science (LNCS), pages 52-78. Springer, 1995.
16. G. Bella. Inductive Verification of Cryptographic Protocols. PhD thesis, Research Report 493, Computer Laboratory, University of Cambridge, 2000.
17. G. Bella and S. Bistarelli. SCSPs for modelling attacks to security protocols. In Proc. CP2000 Post-Conference Workshop on SOFT CONSTRAINTS: THEORY AND PRACTICE, 2000.
18. G. Bella and S. Bistarelli. Soft constraints for security protocol analysis: Confidentiality. In Proc. 3nd International Symposium on Practical Aspects of Declarative Languages (PADL'01), volume 1990 of Lecture Notes in Computer Science (LNCS), pages 108-122. Springer, 2001.
19. G. Bella and S. Bistarelli. Confidentiality levels and deliberate/indeliberate protocol attacks. In Proc. 10th International Cambridge Security Protocol Workshop, Lecture Notes in Computer Science (LNCS). Springer, 2002. To appear.
20. G. Bella and S. Bistarelli. Confidentiality levels and deliberate/indeliberate protocol attacks. In Proc. 10th Cambridge International Security Protocol Workshop (CISPW2002), Lecture Notes in Computer Science (LNCS). Springer, 2002. Forthcoming.
21. G. Bella, F. Massacci, and L.C. Paulson. Verifying the SET Registration Protocols. IEEE Journal of Selected Areas in Communications, 1(21):77-87, 2003.
22. G. Bella and L.C. Paulson. Kerberos version iv: Inductive analysis of the secrecy goals. In J.-J Quisquater, Y. Desware, C. Meadows, and D. Gollmann, editors, Proc. European Symposium on Research in Computer Security (ESORICS98), volume 1485 of Lecture Notes in Computer Science (LNCS), pages 361-375. SV, 1998.
23. G. Bella and E. Riccobene. Formal analysis of the kerberos authentication system. Journal of Universal Computer Science (J. UCS), 3(12):1337-1381, 1997.
24. R.E. Bellman. Dynamic Programming. Princeton University Press, 1957.
25. R.E. Bellman and S.E. Dreyfus. Applied Dynamic Programming. Princeton University Press, 1962.
26. J. Bellone, A. Chamard, and C. Pradelles. Plane - an evolutive planning system for aircraft production. In Proc. 1st Interantional Conference on Practical Applications of Prolog (PAP92), 1992.
27. B.W. Benson and E. Freuder. Interchangeability preprocessing can improve forward checking search. In Proc. 10th European Conference on Artificial Intelligence (ECAI-92), pages 28-30. Pitman Publishing, 1992.
28. U. Bertelè and F. Brioschi. Nonserial Dynamic Programming. Academic Press, 1972.
29. C. Bessière. Arc-consistency and arc-consistency again. Artificial Intelligence, 65(1):179-190, 1994.
30. G. Birkhoff and S. Mac Lane. A Survey of Modern Algebra. The Macmillan Company, 1965.
31. S. Bistarelli. Programmazione con vincoli pesati e ottimizzazione. Master's thesis, Dipartimento di Informatica, Università di Pisa, Italy, 1994. In Italian.
32. S. Bistarelli. Soft Constraint Solving and programming: a general framework. PhD thesis, Dipartimento di Informatica, Università di Pisa, Italy, 2001.
33. S. Bistarelli, P. Codognet, Y. Georget, and F. Rossi. Abstracting soft constraints. In Proc. Cyprus ERCIM/COMPULOG workshop, volume 1865 of Lecture Notes in Artificial Intelligence (LNAI), pages 108-133. Springer, 2000.
34. S. Bistarelli, P. Codognet, Y. Georget, and F. Rossi. Labeling and partial local consistency for soft constraint programming. In Proc. 2nd International Workshop on Practical Aspects of Declarative Languages (PADL'00), volume 1753 of Lecture. Notes in Computer Science (LNCS), pages 230-248. Springer, 2000.
35. S. Bistarelli, P. Codognet, and F. Rossi. An abstraction framework for soft constraint. In Proc. Symposium on Abstraction, Reformulation and Approximation (SARA2000), volume 1864 of Lecture, Notes in Artificial Intelligence (LNAI), pages 71-86. Springer, 2000.
36. S. Bistarelli, P. Codognet, and F. Rossi. Abstracting soft constraints: Framework, properties, examples. Artificial Intelligence, 139(2):175-211, 2002.
37. S. Bistarelli, B. Faltings, and N. Neagu. Interchangeability in soft csps. In Proc. 8th International Conference on Principles and Practice of Constraint Programming (CP2002), volume 2470 of Lecture Notes in Computer Science (LNCS). Springer, 2002.
38. S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and valued CSPs: Basic properties and comparison. In Over-Constrained Systems, volume 1106 of Lecture Notes in Computer Science (LNCS), pages 111-150. Springer, 1996.
39. S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and Valued CSPs: Frameworks, properties, and comparison. CONSTRAINTS, 4(3):199-240, 1999.
40. S. Bistarelli and S. Foley. Analysis of integrity policies using soft constraints. In Proc. IEEE 4th international Workshop on Policies for Distributed Systems and Networks (POLICY2003), Lake Como, Italy, 2003. IEEE.
41. S. Bistarelli and S. Foley. A constraint framework for the qualitative analysis of dependability goals: Integrity. In Proc. 22th international Conference on Computer safety, Reliability and Security (SAFECOMP2003), Lecture Notes in Computer Science (LNCS). Springer, 2003. Forthcoming.
42. S. Bistarelli, T. Fruewirth, M. Marte, and F. Rossi. Soft constraint propagation and solving in chr. In Proc. ACM Symposium on Applied Computing (SAC), pages 1-5. ACM, 2002.
43. S. Bistarelli, R. Gennari, and F. Rossi. Constraint propagation for soft constraint satisfaction problems: Generalization and termination conditions. In Proc. 6th International Conference on Principles and Practice of Constraint Programming (CP2000), volume 1894 of Lecture Notes in Computer Science (LNCS), pages 83-97. Springer, 2000.
44. S. Bistarelli, R. Gennari, and F. Rossi. General properties and termination conditions for soft constraint propagation. Constraints, 8(1):79-97, 2003.
45. S. Bistarelli, U. Montanari, and F. Rossi. Constraint Solving over Semirings. In Proc. 14th International Joint Conference on Artificial Intelligence (IJCAI95), pages 624-630, San Francisco, CA, USA, 1995. Morgan Kaufman.
46. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Logic Programming. In Proc. 15th International Joint Conference on Artificial Intelligence (IJCAI97), pages 352-357, San Francisco, CA, USA, 1997. Morgan Kaufman.
47. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM (JACM), 44(2):201-236, 1997.
48. S. Bistarelli, U. Montanari, and F. Rossi. SCLP semantics for (multi-criteria) shortest path problems. In Proc. Workshop on Integration of AI and OR technique in Constraint Programming for Combinatorial Optimization Problems (CPAI-OR'99), Ferrara, Italy, 1999.
49. S. Bistarelli, U. Montanari, and F. Rossi. Higher order semiring-based constraints. In Proc. CP2000 Post-Conference Workshop on SOFT CONSTRAINTS: THEORY AND PRACTICE, 2000.
50. S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Logic Programming: Syntax and Semantics. ACM Transactions on Programming Languages and System (TOPLAS), 23(1):1-29, 2001.
51. S. Bistarelli, U. Montanari, and F. Rossi. Soft constraint logic programming and generalized shortest path problems. Journal of Heuristics, 8(1):25-41, 2001.
52. S. Bistarelli, U. Montanari, and F. Rossi. Soft concurrent constraint programming. In Proc. 11th European Symposium on Programming (ESOP), Lecture Notes in Computer Science (LNCS), pages 53-67. Springer, 2002.
53. S. Bistarelli and E. Riccobene. An operational model for the SCLP language. In Proc. ILPS97 workshop on Tools and Environments for (Constraint) Logic Programming, 1997.
54. S. Bistarelli and F. Rossi. About Arc-Cconsistency in Semiring-based Constraint Problems. In Proc. 5th International Symposium on Artificial Intelligence and Mathematics, 1998.
55. Stefano Bistarelli, Boi Faltings, and Nicoleta Neagu. Interchangeability in soft csps. In Recent Advances in Constraints, Proc. Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Cork, Ireland, June 19-21, 2002. Selected Papers, volume 2627 of Lecture Notes in Computer Science (LNCS). Springer, 2003.
56. C. Bodei, P. Degano, F. Nielson, and H.R. Nielson. Security analysis using flow logics. In Current Trends in Theoretical Computer Science, pages 525-542. World Scientific, 2001.
57. C. Bodei, P. Degano, F. Nielson, and H.R. Nielson. Static analysis for secrecy and non-interference in networks of processes. In Proc. 6th International Conference on Parallel Computing Technologies (PaCT 2001), volume 2127 of Lecture Notes in Computer Science (LNCS), pages 27-41. Springer, 2001.
58. F.S. De Boer and C. Palamidessi. A fully abstract model for concurrent constraint programming. In Proc. Colloquium on Trees in Algebra and Programming (CAAP91), volume 493 of Lecture Notes in Computer Science (LNCS), pages 296-319. Springer, 1991.
59. E. Börger. Specification and Validation Methods. Oxford University Press, 1994.
60. A. Borning. The programming language aspects of thinglab, a constraint oriented simulation laboratory. ACM Transaction on Programming Languages and Systems (TOPLAS), 3(4):353-387, 1981.
61. A. Borning, B. Freeman-Benson, and M. Wilson. Constraint hierachies. Lisp and Symbolic Computation, 5(3):223-270, 1992.
62. A. Borning, M. Maher, A. Martindale, and M. Wilson. Constraint hierarchies and logic programming. In G. Levi and M. Martelli, editors, Proc. 6th International Conference on Logic Programming (ICLP89), pages 149-164. MIT Press, 1989.
63. M. Calisti and B. Faltings. Distributed constrained agents for allocating service demands in multi-provider networks,. Journal of the Italian Operational Research Society, XXIX(91), 2000. Special Issue on Constraint-Based Problem Solving.
64. I. Cervesato, N.A. Durgin, P. Lincoln, J.C. Mitchell, and A. Scedrov. A metanotation for protocol analysis. In Proc. 12th IEEE Computer Security Foundations Workshop (CSFW99), pages 55-69. IEEE Computer Society, 1999.
65. P. Chan, K. Heus, and G. Veil. Nurse scheduling with global constraints in CHIP: Gymnaste. In Proc. 4th International Conference and Exhibition on The Practical Application of Constraint Technology (PACT98), London, UK, 1998.
66. S. Chen and K. Nahrstedt. Distributed qos routing with imprecise state information. In Proc. 7th IEEE International Conference on Computer, Communications and Networks (ICCCN'98), pages 614-621, 1998.
67. Berthe Y. Choueiry. Abstraction Methods for Resource Allocation. PhD thesis, EPFL, 1994. n. 1292.
68. Berthe Y. Choueiry and Guevara Noubir. On the computation of local interchangeability in discrete constraint satisfaction problems. In Proc. 17th National Conference on Artificial Intelligence (AAAI-98), pages 326-333, 1998.
69. K.P. Chow and M. Perrett. Airport counter allocation using constraint logic programming. In Proc. 3rd International Conference on The Practical Application of Constraint Technology (PACT97), London, UK, 1997.
70. A.H.W. Chun, S.H.C. Chan, F.M.F. Tsang, and D.W.M. Yeung. Stand allocation with constraint technologies at Chek Lap Kok international airport. In Proc. 1st International Conference and Exhibition on The Practical Application of Constraint Technologies and Logic Programming (PACLP99), London, UK, 1999.
71. D. Clark. Rfc1102: Policy routing in internet protocols. Technical report, Network Working Group, 1989.
72. P. Codognet and D. Diaz. Compiling constraints in clp(fd). Journal of Logic Programming, 27(3):185-226, 1996.
73. C. Collignon. Gestion optimisee de ressources humaines pour l'audiovisuel. In Proc. CHIP users' club 96, 1996.
74. H. Comon, V. Cortier, and J. Mitchell. Tree automata with one memory, set constraints and ping-pong protocols. In Proc. 28th Int. Coll. Automata, Languages, and Programming (ICALP'2001), volume 2076 of Lecture Notes in Computer Science (LNCS), pages 682-693. Springer, 2001. To appear.
75. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms, chapter 26. MIT Press, 1990.
76. P. Cousot. Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice. Technical Report R.R.88, Institut National Polytechnique de Grenoble, 1977.
77. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th ACM Symposium on Principles of Programming Languages (POPL77), pages 238-252, 1977.
78. P. Cousot and R. Cousot. Systematic design of program analyis. In Proc. 6th ACM Symposium on Principles of Programming Languages (POPL79), pages 269-282, 1979.
79. P. Cousot and R. Cousot. Abstract interpretation and application to logic programming. Journal of Logic Programming, 13(2-3):103-179, 1992.
80. B.A. Davey and H.A. Priestley. Introduction to lattices and order. Cambridge University Press, 1990.
81. F. de Boer and C. Palamidessi. From Concurrent Logic Programming to Concurrent Constraint Programming. In Advances in Logic Programming Theory, pages 55-113. Oxford University Press, 1994.
82. Rocco de Nicola, Gian Luigi Ferrari, and R. Pugliese. Klaim: a kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering (Special Issue on Mobility and Network Aware Computing), 1998.
83. R. Dechter and A. Dechter. Ief maintenance in dynamic constraint networks. In Proc. 7th National Conference on Artificial Intelligence (AAAI-88), pages 37-42, 1988.
84. R. Dechter, A. Dechter, and J. Pearl. Optimization in constraint networks. In Influence Diagrams, Belief Nets and Decision Analysis, pages 411-425. John Wiley & Sons Ltd., 1990.
85. R. Dechter and J. Pearl. Network-Based Heuristics for Constraint-Satisfaction Problems. In Search in Artificial Intelligence, pages 370-425. Springer, 1988.
86. R. Dechter and J. Pearl. Tree-clustering schemes for constraint processing. In Proc. 7th National Conference on Artificial Intelligence (AAAI-88), pages 150-154, 1988.
87. D.E. Denning. A lattice model of secure information flow. Communications of the ACM (CACM), 19(5):236-242, 1976.
88. M. Dincbas and H. Simonis. Apache - a constraint based, automated stand allocation system. In Proc. of Advanced Software technology in Air Transport (ASTAIR'91), London, UK, 1991.
89. D. Dolev and A. Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 2(29):198-208, 1983.
90. S.E. Dreyfus. An appraisal of some shortest-paths algorithms. Operation Research, 17:395-412, 1969.
91. D. Dubois, H. Fargier, and H. Prade. The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In Proc. IEEE International Conference on Fuzzy Systems, pages 1131-1136. IEEE Computer Society, 1993.
92. A. Dubos and A. Du Jeu. Application EPPER planification des ageents roulants. In Proc. CHIP users' club 96, 1996.
93. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. Workshop on Formal Methods and Security Protocols (FMSP'99), 1999.
94. T. Ellman. Synthesis of abstraction hierarchies for constraint satisfaction by clustering approximately equivalent objects. In Proc. of International Conference on Machine Learning, pages 104-111, 1993.
95. M.H. Van Emden. Quantitative deduction and its fixpoint theory. Journal of Logic Programming, 3(1):37-53, 1986.
96. H. Fargier and J. Lang. 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 Lecture Notes in Computer Science (LNCS), pages 97-104. Springer, 1993.
97. R.E. Fikes. REF-ARF: A system for solving problems stated as procedures. Artificial Intelligence, 1:27-120, 1970.
98. M. Fitting. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11(1-2):91-116, 1981.
99. R.W. Floyd. Algorithm 97: Shortest path. Communication of ACM (CACM), 5:345, 1962.
100. F. Focacci, E. Lamma, P. Mello, and M. Milano. Constraint logic programming for the crew rostering problem. In Proc. 3rd International Conference on The Practical Application of Constraint Technology(PACT97), London, UK, 1997.
101. R. Focardi, R. Gorrieri, and F. Martinelli. Information flow analysis in a discrete-time process algebra. In Proc. 13th IEEE Computer Security Foundations Workshop (CSFW'OO), pages 170-184. IEEE Computer Society, 2000.
102. R. Focardi, R. Gorrieri, and F. Martinelli. Non interference for the analysis of cryptographic protocols. In Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP00), volume 1853 of Lecture Notes in Computer Science (LNCS), pages 354-372. Springer, 2000.
103. S. Foley. Personal conversations, nov 2002.
104. E.C. Freuder. Synthesizing constraint expressions. Communication of the ACM (CACM), 21(11):958-966, 1978.
105. E.C. Freuder. Backtrack-free and backtrack-bounded search. In Search in Artificial Intelligence, pages 343-369. Springer, 1988.
106. E.C. Freuder. Eliminating interchangeable values in constraint satisfaction subproblems. In P. Marcotte and S. Nguyen, editors, Proc. 10th National Conference on Artificial Intelligence (AAAI-91), pages 227-233, 1991.
107. E.C. Freuder and D. Sabin. Interchangeability supports abstraction and reformulation for constraint satisfaction. In Proc. Symposium on Abstraction, Reformulation and Approximation (SARA '95), 1995.
108. E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21-70, 1992.
109. M. Fromherz, V. Gupta, and V. Saraswat. Model-based computing: constructing constraint-based software for electro-mechanical systems. In Proc. 1st International Conference on The Practical Application of Constraint Technology (PACT97), 1995.
110. T. Frühwirth and P. Brisset. Optimal planning of digital cordless telecommunication systems. In Proc. 3rd International Conference on The Practical Application of Constraint Technology (PACT97), London, UH, 1997.
111. Y. Georget. Extensions de, la Programmation par Contraintes. PhD thesis, Ecole Polytecnique, Paris, 1999.
112. Y. Georget and P. Codognet. Compiling semiring-based constraints with clp(fd,s). In Proc, 4th International Conference on Principles and Practice of Constraint Programming (CP98), volume 1520 of Lecture Notes in Computer Science (LNCS), pages 205-219. Springer, 1998.
113. C. Gervet, Y. Caseau, and D. Montaut. On refining ill-defined constraint problems: A case study in iterative prototyping. In Proc. 1st International Conference and Exhibition on The Practical Application of Constraint Technologies and Logic Programming (PACLP99), London, UK, 1999.
114. R. Giacobazzi, S.K. Debray, and G. Levi. A Generalized Semantics for Constraint Logic Programs. In Proc. FGCS92, pages 581-591. ICOT, 1992.
115. F. Glaisner and L.-M. Richard. FORWARD-C: A refinery scheduling system. In Proc. 3rd International Conference on The Practical Application of Constraint Technology(PACT97), London, UK, 1997.
116. S. Gnesi, A. Martelli, and U. Montanari. Dynamic programming as graph searching: an algebraic approach. Journal of the ACM (JACM), 28(5):737-751, 1981.
117. E. Gray. American national standard T1.523-2001, telecom glossary 2000. published on the Web at http://www.its.bldrdoc.gov/projects/telecomglossary2000, 2001.
118. Y. Gurevich. Evolving algebras 1993: Lipari guide. In Specification and Validation Methods, pages 9-36. Oxford University Press, 1995.
119. M. Gyssens, P.G. Jeavons, and D.A. Cohen. Decomposing Constraint Satisfaction Problems Using Database Techniques. Artificial Intelligence, 66(1):57-89, 1994.
120. A. Haselbock. Exploiting interchangeabilities in constraint satisfaction problems. In Proc. 13th International Joint Conference on Artificial Intelligence (IJCAI91), pages 282-287. Morgan Kaufman, 1993.
121. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989.
122. P. Van Hentenryck, Y. Deville, and C.M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57:291-321, 1992.
123. International Organization for Standardization. Information processing systems - Open Systems Interconnection - Basic Reference Model - Part 2: Security Architecture (ISO 7498-2), 1989.
124. N. Itoi and P. Honeyman. Smartcard Integration with Kerberos V5. In Proceedings of the USENIX Workshop on Smartcard Technology, pages 59-62, 1999.
125. J. Jaffar and J.L. Lassez. Constraint logic programming. Technical report, IBM T.J. Watson Research Center, Yorktown Heights, 1986.
126. J. Jaffar and J.L. Lassez. Constraint logic programming. In Proc. 14th ACM Symposium on Principles of Programming Languages (POPL87), pages 111-119. ACM, 1987.
127. J. Jaffar and M.J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19-20:503-581, 1994.
128. R. Jain and W. Sun. QoS/Policy/Constraint-Based routing. In Carrier IP Telephony 2000 Comprehensive Report. International Engineering Consortium, 2000.
129. P.C. Kanellakis and D.Q. Goldin. Constraint programming and database query languages. In Proc. 2nd International Symposium on Theoretical Aspects of Computer Software (TACS94), volume 789 of Lecture Notes in Computer Science (LNCS), pages 66-77. Springer, 1994.
130. P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint query languages. Journal of Computer and System Science, 51(1):26-52, 1995.
131. F. Kokkoras and S. Gregory. D-WMS: Distributed workforce management using CLP. In Proc. 4th International Conference and Exhibition on The Practical Application of Constraint Technology (PACT98), London, UK, 1998.
132. V. Kumar. Algorithms for constraint satisfaction problems: a survey. AI Magazine, 13(1):32-44, 1992.
133. J-L. Lauriere. A language and a program for stating and solving combinatorial problems. Artifical Intelligence, 10:29-127, 1978.
134. W. Leler. Constraint Programming Languages, their specification and generation. Addison-Wesley, 1988.
135. J.W. Lloyd. Foundations of Logic Programming. Springer, 1987.
136. G. Lowe. An attack on the needham-schroeder public-key authentication protocol. Information Processing Letters, 56(3):131-133, 1995.
137. G. Lowe. Some new attacks upon security protocols. In Proc. 9th IEEE Computer Security Foundations Workshop (CSFW96), pages 139-146. IEEE Computer Society, 1996.
138. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99-118, 1977.
139. A.K. Mackworth. Constraint satisfaction. In Encyclopedia of AI (second edition), pages 285-293. John Wiley & Sons Ltd., 1992.
140. A.K. Mackworth and E.C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25:65-74, 1985.
141. K. Marriott and P. Stuckey. Programming with Constraints. MIT Press, 1998.
142. A. Martelli and U. Montanari. Nonserial dynamic programming: on the optimal strategy of variable elimination for the rectangular lattice. Journal of Mathematical Analysis and Application, 40:226-242, 1972.
143. W. Maximuck and M. Reviakin. A prototype of train schedule module. In Proc. 4th International Conference and Exhibition on The Practical Application of Constraint Technology (PACT98), London, UK, 1998.
144. C. Meadows. Private conversations, 2001.
145. J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In Proc. 8th ACM Conference on Computer and Communication Security, pages 166-175. ACM, 2001.
146. S.P. Miller, J.I. Neuman, J.I. Schiller, and J.H. Saltzer. Kerberos Authentication and Authorisation System. Technical Plan, MIT - Project Athena, 1989.
147. J. C. Mitchell, M. Mitchell, and U. Stern. Automated Analysis of Cryptographic Protocols Using Murphi. In Proc. IEEE Symposium on Security and Privacy. IEEE Press, 1997.
148. B. Mobasher, D. Pigozzi, and G. Slutzki. Multi-valued logic programming semantics: An algebraic approach. Theoretical Computer Science, 171(1-2):77-109, 1997.
149. U. Montanari. Fundamental properties and applications to picture processing, information sciences. Technical Report 71-1, Dept. of Computer Science, Carnegie Mellon University, 1971.
150. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7:95-132, 1974.
151. U. Montanari and F. Rossi. An efficient algorithm for the solution of hierachical networks of constraints. In Proc. 3rd International Workshop on Graph Grammars and their Application to Computer Science, volume 291 of Lecture Notes in Computer Science (LNCS), pages 440-457. Springer, 1986.
152. U. Montanari and F. Rossi. Constraint relaxation may be perfect. Artificial Intelligence, 48:143-170, 1991.
153. P. Morris. On the density of solutions in equilibrium points for the queens problem. In Proc. 11th National Conference on Artificial Intelligence (AAAI-92), pages 428-433, 1992.
154. H. Moulin. Axioms for Cooperative Decision Making. Cambridge University Press, 1988.
155. N. Neagu and B. Faltings. Exploiting interchangeabilities for case adaptation. In International Conference on Case-Based Reasoning (ICCBR'02), Lecture Notes in Computer Science (LNCS), pages 422-436. Springer, 2001.
156. B. C. Neuman and T. Ts'o. Kerberos: An authentication service for computer networks. In William Stallings, Practical Cryptography for Data Internetworks. IEEE Press, 1996.
157. L. Pacholski and A. Podelski. Set constraints: A pearl in research on constraints (invited tutorial). In Proc. Principles and Practice of Constraint Programming (CP97), volume 1330 of Lecture Notes in Computer Science (LNCS), pages 549-562. Springer, 1997.
158. S. Pallottino and M.G. Scutellà. Equilibrium and Advanced Transportation Modelling, chapter 11. Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects, pages 245-281. Kluwer, 1998.
159. V. Pareto. Manual of Political Economy. Augustus M. Kelley, 1971. orig. (1906) in Italian.
160. L.C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
161. M. Perrett. Using constraint logic programming techniques in container port planning. ICL Technical Journal, pages 537-545, 1991.
162. G.D. Plotkin. Post-graduate lecture notes in advanced domain theory (incorporating the pisa lecture notes). Technical report, Dept. of Computer Science, Univ. of Edinburgh, 1981.
163. J-F. Puget. A C++ implementation of CLP. In Proc. Singapore International Conference on Intelligent Systems (SPICIS'94), 1994.
164. L. Purvis and P. Jeavons. Constraint tractability theory and its application to the product development process for a constraint-based scheduler. In Proc. 1st International Conference and Exhibition on The Practical Application of Constraint Technologies and Logic Programming (PACLP99), London, UK, 1999.
165. A. Rosenfeld, R.A. Hummel, and S.W. Zucker. Scene labelling by relaxation operations. IEEE Transactions on Systems, Man, and Cybernetics (T-SMC), 6(6):420-433, 1976.
166. F. Rossi. Redundant hidden variables in finite domain constraint problems. In Constraint Processing, volume 923 of Lecture Notes in Computer Science (LNCS), pages 205-223. Springer, 1995.
167. Z. Ruttkay. Fuzzy constraint satisfaction. In Proc. 3rd IEEE International Conference on Fuzzy Systems, pages 1263-1268, 1994.
168. Z. Ruttkay. Constraint satisfaction - a survey. CWI Quarterly, 11(2-3):163-214, 1998.
169. G. Verfaillie S. de Givry and T. Schiex. Bounding the optimum of constraint optimization problems. In G. Smolka, editor, Proc. 3rd International Conference on Principles and Practice of Constraint Programming (CP97), volume 1330 of Lecture Notes in Computer Science (LNCS), pages 405-419. Springer, 1997.
170. D. Sabin and E.C. Freuder. Understanding and improving the mac algorithm. In Proc. 3rd International Conference on Principles and Practice of Constraint Programming (CP97), volume 1330 of Lecture Notes in Computer Science (LNCS), pages 167-181. Springer, 1997.
171. V.A. Saraswat. Concurrent Constraint Programming. MIT Press, 1993.
172. V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proc. 18th ACM Symposium on Principles of Programming Languages (POPL91), pages 333-352. ACM, 1991.
173. T. Schiex. Possibilistic constraint satisfaction problems, or "how to handle soft constraints?". In Proc. 8th Conference of Uncertainty in Artificial Intelligence (UAI92), pages 269-275. Morgan Kaufmann, 1992.
174. T. Schiex, H. Fargier, and G. Verfaille. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proc. 14th International Joint Conference on Artificial Intelligence (IJCAI95), pages 631-637, San Francisco, CA, USA, 1995. Morgan Kaufmann.
175. R. Schrag and D. Miranker. An evaluation of domain reduction: Abstraction for unstructured CSPs. In Proc. Symposium on Abstraction, Reformulation, and Approximation (SARA92), pages 126-133, 1992.
176. D. De Schreye, M. Leuschel, and B. Martens. Tutorial on program specialisation. In Proc. International Logic Programming Symposium (ILPS95), pages 615-616. MIT Press, dec 1995.
177. D.S. Scott. Domains for denotational semantics. In Proc. 9th International Colloquium on Automata, Languages and Programming (ICALP82), volume 140, pages 577-613. Springer, 1982.
178. P. Shenoy. Valuation-based systems for discrete optimization. In Uncertainty in Artificial Intelligence. Elsevier Science, 1991.
179. P. Shenoy. Valuation-based systems: A framework for managing uncertainty in expert systems. In Fuzzy Logic for the Management of Uncertainty, pages 83-104. John Wiley & Sons Ltd., 1994.
180. H. Simonis and P. Charlier. Cobra - a system for train crew scheduling. In Proc. DIMACS workshop on constraint programming and large scale combinatorial optimization, 1998.
181. H. Simonis and T. Cornelissens. Modelling producer/consumer constraints. In Proc. 1st International Conference on Principles and Practice of Constraint Programming (CP95), volume 976 of Lecture Notes in Computer Science (LNCS), pages 449-462. Springer, 1995.
182. M.B. Smyth. Power domains. Journal of Computer and System Sciences, 16(1):23-36, 1978.
183. R. Sosic and J. Gu. 3000000 queens in less than one minute. SIGART Bulletin, 2(3):22-24, 1991.
184. G.L. Steel. The definition and implementation of a computer programming language based on Constraints. PhD thesis, MIT, 1980.
185. D.R. Stinson. Cryptography Theory and Practice. CRC Press, 1995.
186. G.J. Sussman and G.L. Steele. CONSTRAINTS - a language for expressing almost-hierarchical descriptions. Artificial Intelligence, 14(1):1-39, 1980.
187. I. Sutherland. Sketchpad: a man-machine graphical communication system. In Proc. Spring Joint Computer Conference, volume 23 of AFIPS, pages 329-346, 1963.
188. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.
189. E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
190. M. Wallace. Practical applications of constraint programming. Constraints, 1(1-2):139-168, 1996.
191. T. Walsh and F. Giunchiglia. Theories of abstraction: A historical perspective. In Proc. AAAI-92 Workshop on Approximation and Abstraction of Computational Theories, 1992.
192. T. Walsh and F. Giunchiglia. A theory of abstraction. Artificial Intelligence, 56(2-3):323-390, 1992.
193. D.L. Waltz. Understanding line drawings of scenes with shadows. In The Psychology of Computer Vision, pages 19-91. McGraw-Hill, 1975.
194. R. Weigel and B. Faltings. Compiling constraint satisfaction problems. Artificial Intelligence, 115:257-289, 1999.
195. Rainer Weigel, Boi Faltings, and Marc Torrens. Interchangeability for case adaptation in configuration problems. In Workshop on Case-Based Reasoning Integrations (AAAI-98), volume WS-98-15, pages 166-171, Madison, Wisconsin, USA, July 1998. AAAI Press.
196. L.A. Zadeh. Fuzzy sets. Information and Control, 8(3):338-353, 1965.