Advertisement

Semiring-Based Soft Constraints

  • Stefano Bistarelli
  • Francesca Rossi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5065)

Abstract

The semiring-based formalism to model soft constraint has been introduced in 1995 by Ugo Montanari and the authors of this paper. The idea was to make constraint programming more flexible and widely applicable. We also wanted to define the extension via a general formalism, so that all its instances could inherit its properties and be easily compared. Since then, much work has been done to study, extend, and apply this formalism. This papers gives a brief summary of some of these research activities.

Keywords

Constraint Satisfaction Constraint Programming Constraint Satisfaction Problem Temporal Constraint Soft 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)Google Scholar
  2. 2.
    Bella, G., Bistarelli, S.: Soft Constraints for Security Protocol Analysis: Confidentiality. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Bella, G., Bistarelli, S.: Soft Constraint Programming to Analysing Security Protocols. In: Theory and Practice of Logic Programming (TPLP), special Issue on Verification and Computational Logic, vol. 4(5), pp. 1–28. Cambridge University Press, Cambridge (2004)Google Scholar
  4. 4.
    Bella, G., Bistarelli, S.: Confidentiality levels and deliberate/indeliberate protocol attacks. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2002. LNCS, vol. 2845, pp. 104–119. Springer, Heidelberg (2004)Google Scholar
  5. 5.
    Bella, G., Bistarelli, S.: Information Assurance for Security Protocols. Computers & Security 24(4), 322–333 (2005)CrossRefGoogle Scholar
  6. 6.
    Biso, A., Rossi, F., Sperduti, A.: Experimental results on Learning Soft Constraints. In: Proc. KR 2000 (7th Int. Conf. on Principles of Knowledge Representation and Reasoning) (2000)Google Scholar
  7. 7.
    Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. LNCS, vol. 2962. Springer, Heidelberg (2004)Google Scholar
  8. 8.
    Bistarelli, S., Bonchi, F.: Soft Constraint Based Pattern Mining. Data & Knowledge Engineering 62(1) (2007)Google Scholar
  9. 9.
    Bistarelli, S., Bonchi, F.: Extending the Soft Constraint Based Mining Paradigm. In: Džeroski, S., Struyf, J. (eds.) KDID 2006. LNCS, vol. 4747, Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Bistarelli, S., Codognet, P., Rossi, F.: Abstracting Soft Constraints: Framework, Properties, Examples. Artificial Intelligence Journal 139, 175–211 (2002)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Bistarelli, S., Faltings, B., Neagu, N.: Interchangeability in Soft CSPs. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, Springer, Heidelberg (2002)Google Scholar
  12. 12.
    Bistarelli, S., Faltings, B., Neagu, N.: Experimental Evaluation of Interchangeability in Soft CSPs. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds.) CSCLP 2003. LNCS (LNAI), vol. 3010, Springer, Heidelberg (2004)Google Scholar
  13. 13.
    Bistarelli, S., Fargier, H., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G.: Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison. In: Constraints, vol. 4(3), Kluwer, Dordrecht (1999)Google Scholar
  14. 14.
    Bistarelli, S., Foley, S.N.: Analysis of Integrity Policies using Soft Constraints. In: Proc. IEEE POLICY 2003 (2003)Google Scholar
  15. 15.
    Bistarelli, S., Foley, S.N.: A Constraint Based Framework for Dependability Goals: Integrity. In: Anderson, S., Felici, M., Littlewood, B. (eds.) SAFECOMP 2003. LNCS, vol. 2788. Springer, Heidelberg (2003)Google Scholar
  16. 16.
    Bistarelli, S., Foley, S.N., O’Sullivan, B.: Reasoning about Secure Interoperation using Soft Constraints. In: Proc. IFIP TC1 WG1.7 Workshop on Formal Aspects in Security and Trust (FAST), Kluwer, Dordrecht (2005)Google Scholar
  17. 17.
    Bistarelli, S., Foley, S.N., O’Sullivan, B.: Detecting and Eliminating the Cascade Vulnerability Problem from Multi-level Security Networks using Soft Constraints. In: Proc. IAAI 2004, AAAI Press, Menlo Park (2004)Google Scholar
  18. 18.
    Bistarelli, S., Foley, S.N., O’Sullivan, B.: A soft constraint-based approach to the cascade vulnerability problem. Journal of Computer Security 13(5), 699–720; Special Issue: Security Track at ACM Symposium on Applied Computing (2004)Google Scholar
  19. 19.
    Bistarelli, S., Fruehwirth, T., Marte, M., Rossi, F.: Soft Constraint Propagation and Solving in Constraint Handling Rules. Special issue of Computational Intelligence on Preferences in AI and CP 20(2), 287–307 (2004)Google Scholar
  20. 20.
    Bistarelli, S., Gabbrielli, M., Meo, M.C., Santini, F.: Timed Soft Concurrent Constraint Programs. In: Proc. CP2007 Doctoral Program, Providence RI - USA (2007)Google Scholar
  21. 21.
    Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: Proc. ECAI 2006, pp. 63–67. IOS Press, Amsterdam (2006)Google Scholar
  22. 22.
    Bistarelli, S., Gennari, R., Rossi, F.: General Properties and Termination Conditions for Soft Constraint Propagation. Constraints: An International Journal, Constraints 8(1) (2003)Google Scholar
  23. 23.
    Bistarelli, S., Keleher, J., O’Sullivan, B.: Symmetry Breaking in Soft CSPs. In: Proc. AI-2003, BCS Conference Series Research and Development in Intelligent Systems xx. Springer, Heidelberg (2004)Google Scholar
  24. 24.
    Bistarelli, S., Marte, M., Fruhwirth, T., Rossi, F.: Soft Constraint propagation and Solving with CHRs. In: Proc. SAC 2002 (ACM Symposium on Applied Computing), Madrid (March 2002) Google Scholar
  25. 25.
    Bistarelli, S., Montanari, U., Rossi, F.: Soft Concurrent Constraint Programming. ACM Transactions on Computational Logic (TOCL) 7(3), 1–27 (2006)MathSciNetGoogle Scholar
  26. 26.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Solving and Optimization. Journal of the ACM 44(2), 201–236 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Bistarelli, S., Montanari, U., Rossi, F.: Constraint Solving over Semirings. In: Proc. IJCAI 1995, Morgan Kaufmann, San Francisco (1995)Google Scholar
  28. 28.
    Bistarelli, S., Montanari, U., Rossi, F.: Soft Constraint Logic Programming and Generalized Shortest Path Problems. Journal of Heuristics 8(1) (2002)Google Scholar
  29. 29.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Logic Programming. In: Proc.15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 352–357. Morgan Kaufman, San Francisco (1997)Google Scholar
  30. 30.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based Constraint Logic Programming: Syntax and Semantics. ACM Transactions on Programming Languages and System (TOPLAS) 23(1), 1–29 (2001)CrossRefGoogle Scholar
  31. 31.
    Bistarelli, S., Montanari, U., Rossi, F.: Soft Concurrent Constraint Programming. In: Le Métayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, Springer, Heidelberg (2002)CrossRefGoogle Scholar
  32. 32.
    Bistarelli, S., Montanari, U., Rossi, F., Santini, F.: Modelling Multicast Qos Routing by using Best-Tree Search in AND-OR Graphs and Soft Constraint Logic Programming. In: Proc. Fifth Workshop on Quantitative Aspects of Programming Languages QAPL 2007, ENTCS (2007)Google Scholar
  33. 33.
    Bistarelli, S., Pilan, I., Rossi, F.: Abstracting Soft Constraints: Some Experimental Results. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., Váncza, J. (eds.) CSCLP 2003. LNCS (LNAI), vol. 3010, Springer, Heidelberg (2004)Google Scholar
  34. 34.
    Bistarelli, S., Santini, F.: Propagating Multitrust within Trust Networks. In: Proc. SAC 2008 (to appear, 2008)Google Scholar
  35. 35.
    Bistarelli, S., Santini, F.: Non monotonic soft cc. IIT TR-15/2007 (2007)Google Scholar
  36. 36.
    Brafman, R., Dimopoulos, Y.: Preference-based constraint optimization. Computational Intelligence 22(2), 218–245 (2004)CrossRefMathSciNetGoogle Scholar
  37. 37.
    Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research 21, 135–191 (2004)zbMATHMathSciNetGoogle Scholar
  38. 38.
    Buscemi, M., Montanari, U.: CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, Springer, Heidelberg (2007)CrossRefGoogle Scholar
  39. 39.
    Cooper, M.C.: Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems 134(3), 311–342 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  40. 40.
    Cooper, M.C., Schiex, T.: Arc Consistency for Soft Constraints. Artificial Intelligence 154(1-2), 199–227 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  41. 41.
    Cousot, P., Cousot, R.: 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 (POPL 1977). ACM, New York (1977)Google Scholar
  42. 42.
    Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)Google Scholar
  43. 43.
    Delgado, A., Olarte, C.A., Pérez, J.A., Rueda, C.: Implementing Semiring-Based Constraints Using Mozart. In: Van Roy, P. (ed.) MOZ 2004. LNCS, vol. 3389, pp. 224–236. Springer, Heidelberg (2005)Google Scholar
  44. 44.
    De Nicola, R., et al.: A Formal Basis for Reasoning on Programmable QoS. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772. Springer, Heidelberg (2004)Google Scholar
  45. 45.
    Domshlak, C., Rossi, F., Venable, K.B., Walsh, T.: Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. In: Proc. IJCAI 2003, pp. 215–220. Morgan Kaufmann, San Francisco (2003)Google Scholar
  46. 46.
    Dubois, D., Fargier, H., Prade, H.: The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In: Proc. 2nd IEEE Int. Conf. on Fuzzy Systems. IEEE, Los Alamitos (1993)Google Scholar
  47. 47.
    Duchier, D., Gardent, C., Niehren, J.: Concurrent Constraint Programming in Oz for Natural Language Processing. Programming Systems Lab (1998), http://www.ps.uni-sb.de/Papers
  48. 48.
    Fargier, H., Lang, J.: Uncertainty in Constraint Satisfaction Problems: a Probabilistic Approach. In: Moral, S., Kruse, R., Clarke, E. (eds.) ECSQARU 1993. LNCS, vol. 747. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  49. 49.
    Fargier, H., Lang, J., Schiex, T.: Selecting Preferred Solutions in Fuzzy Constraint Satisfaction Problems. In: Proc. 1st European Congress on Fuzzy and Intelligent Technologies (EUFIT) (1993)Google Scholar
  50. 50.
    Freuder, E.C., Likitvivatanavong, C., Wallace, R.J.: Explanation and implication for configuration problems. In: Proc. IJCAI 2001 workshop on configuration (2001)Google Scholar
  51. 51.
    Freuder, E.C., Wallace, R.J.: Partial Constraint Satisfaction. AI Journal 58 (1992)Google Scholar
  52. 52.
    Gelain, M., Pini, M.S., Rossi, F., Venable, K.B.: Dealing with incomplete preferences in soft constraint problems. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  53. 53.
    Georget, Y., Codognet, P.: Compiling semiring-based constraints with clp(fd,s). In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  54. 54.
    Ghose, A., Harvey, P.: Metric scsps: Partial constraint satisfaction via semiring csps augmented with metrics. In: McKay, B., Slaney, J.K. (eds.) Canadian AI 2002. LNCS (LNAI), vol. 2557, pp. 443–454. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  55. 55.
    Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (1989)Google Scholar
  56. 56.
    Jaffar, J., Lassez, J.L.: Constraint Logic Programming. In: Proc. POPL 1987, ACM, New York (1987)Google Scholar
  57. 57.
    Khatib, L., Morris, P., Morris, R., Rossi, F.: Temporal constraint reasoning with preferences. In: Proc. IJCAI 2001 (August 2001)Google Scholar
  58. 58.
    Larrosa, J., Dechter, R.: On the dual representation of non-binary semiring-based CSPs. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  59. 59.
    Leenen, L., Meyer, T., Ghose, A.K.: Relaxations of semiring constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709. Springer, Heidelberg (2005)Google Scholar
  60. 60.
    Marriott, K., Stuckey, P.J.: Programming with Constraints. MIT Press, Cambridge (1998)zbMATHGoogle Scholar
  61. 61.
    Meseguer, P., Rossi, F., Schiex, T.: Soft constraints. In: Rossi, F., Van Beek, P., Walsh, T. (eds.) Handbook of constraint programming. Elsevier, Amsterdam (2006)Google Scholar
  62. 62.
    Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics 7(3), 321–350 (2002)zbMATHMathSciNetGoogle Scholar
  63. 63.
    Montanari, U.: Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Science 7, 95–132 (1974)CrossRefMathSciNetGoogle Scholar
  64. 64.
    Moretti, M., Rossi, F., Freuder, E., Likitvivatanavong, C., Wallace, R.: Explanations and optimization in preference-based configurators. In: O’Sullivan, B. (ed.) CologNet 2002. LNCS (LNAI), vol. 2627. Springer, Heidelberg (2003)Google Scholar
  65. 65.
    Pini, M.S., Rossi, F., Venable, K.B., Bistarelli, S.: Bipolar preference problems: framework, properties and solving techniques. In: HCII 2007 and DHM 2007. LNCS (LNAI), vol. 4561. Springer, Heidelberg (2007)Google Scholar
  66. 66.
    Rossi, F., Sperduti, A.: Learning solution preferences in constraint problems. Journal of Theoretical and Experimental Artificial Intelligence (JETAI) 10 (1998)Google Scholar
  67. 67.
    Rossi, F., Sperduti, A.: Acquiring both constraint and solution preferences in interactive constraint systems. Constraints 9(4) (2004)Google Scholar
  68. 68.
    Rossi, F., Van Beek, P., Walsh, T. (eds.): Handbook of constraint programming. Elsevier, Amsterdam (2006)Google Scholar
  69. 69.
    Ruttkay, Z.: Fuzzy Constraint Satisfaction. In: Proc. 3rd IEEE Int. Conf. on Fuzzy Systems (1994)Google Scholar
  70. 70.
    Saraswat, V.A.: Concurrent Constraint Programming. MIT Press, Cambridge (1993)Google Scholar
  71. 71.
    Schiex, T.: Arc consistency for soft constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 411–424. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  72. 72.
    Schiex, T., Fargier, H., Verfaillie, G.: Valued Constraint Satisfaction Problems: hard and easy problems. In: Proc. IJCAI 1995 (1995)Google Scholar
  73. 73.
    Smith, B.M., Bistarelli, S., O’Sullivan, B.: Constraint Symmetry for the Soft CSP. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  74. 74.
    Tsang, E.P.K.: Foundations of Constraint Satisfaction. Academic Press, London (1993)Google Scholar
  75. 75.
    Wilson, N.: Decision Diagrams for the Computation of Semiring Valuations. In: Proc. IJCAI 2005 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Stefano Bistarelli
    • 1
    • 2
  • Francesca Rossi
    • 3
  1. 1.Dipartimento di ScienzeUniversità “G. d’Annunzio” di Chieti-PescaraItaly
  2. 2.IIT-CNRPisaItaly
  3. 3.Dipartimento di Matematica Pura e ApplicataUniversità di PadovaItaly

Personalised recommendations