SpringerLink
Log in

Soft Concurrent Constraint Programming with Local Variables

  • Conference paper
  • First Online:
Coordination Models and Languages (COORDINATION 2022)

Part of the book series: IFIP Advances in Information and Communication Technology ((LNCS,volume 13271))

Included in the following conference series:

  • 308 Accesses

Abstract

We extend Soft Concurrent Constraint languages with the possibility to manage variables that are local (i.e., private) to some of the agents. Being constraints soft, it is possible to represent preferences as a partially ordered set. With respect to the related literature using an idempotent operator for constraint composition, a soft language requires a revision of the hiding operator, which is used to locally keep the computation effect on a variable, and conceal it from the global store. We provide the language with labelled and unlabelled reduction semantics as well as bisimulation equivalences, further proving their correspondence.

Research partially supported by the MIUR PRIN 2017FTXR7S “IT-MaTTerS” and by GNCS-INdAM (“Gruppo Nazionale per il Calcolo Scientifico”).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    “Weaker alternative” here means that diagonals allow for axiomatising substitutions at the expenses of working with complete partial orders: see e.g. [15, Definition 11].

References

  1. Aristizábal, A., Bonchi, F., Palamidessi, C., Pino, L., Valencia, F.: Deriving labels and bisimilarity for concurrent constraint programming. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 138–152. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19805-2_10

    Chapter  MATH  Google Scholar 

  2. Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: mobile processes, nominal data, and logic. In: LICS 2009, pp. 39–48. IEEE Computer Society (2009)

    Google Scholar 

  3. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201–236 (1997)

    Article  MathSciNet  Google Scholar 

  4. Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI 2006. FAIA, vol. 141, pp. 63–67. IOS Press (2006)

    Google Scholar 

  5. Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. ACM Trans. Comput. Log. 7(3), 563–589 (2006)

    Article  MathSciNet  Google Scholar 

  6. Bistarelli, S., Pini, M.S., Rossi, F., Venable, K.B.: From soft constraints to bipolar preferences: modelling framework and solving issues. Exp. Theor. Artif. Intell. 22(2), 135–158 (2010)

    Article  Google Scholar 

  7. Bistarelli, S., Santini, F.: A nonmonotonic soft concurrent constraint language to model the negotiation process. Fund. Inform. 111(3), 257–279 (2011)

    MathSciNet  MATH  Google Scholar 

  8. Bonchi, F., Bussi, L., Gadducci, F., Santini, F.: Polyadic soft constraints. In: Alvim, M.S., Chatzikokolakis, K., Olarte, C., Valencia, F. (eds.) The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy. LNCS, vol. 11760, pp. 241–257. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31175-9_14

    Chapter  Google Scholar 

  9. Borralleras, C., Lucas, S., Oliveras, A., Rodríguez-Carbonell, E., Rubio, A.: SAT modulo linear arithmetic for solving polynomial constraints. J. Automed Reasoning 48(1), 107–131 (2012)

    Article  MathSciNet  Google Scholar 

  10. Bortolussi, L., Wiklicky, H.: A distributed and probabilistic concurrent constraint programming language. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 143–158. Springer, Heidelberg (2005). https://doi.org/10.1007/11562931_13

    Chapter  MATH  Google Scholar 

  11. Brim, L., Kretínský, M., Jacquet, J., Gilbert, D.R.: Modelling multi-agent systems as synchronous concurrent constraint processes. Comput. Artif. Intell. 21(6) (2002)

    Google Scholar 

  12. Buscemi, M.G., Montanari, U.: Open bisimulation for the concurrent constraint pi-calculus. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 254–268. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78739-6_20

    Chapter  Google Scholar 

  13. Díaz, J.F., Rueda, C., Valencia, F.D.: Pi+- calculus: a calculus for concurrent processes with constraints. CLEI Electron. J. 1(2) (1998)

    Google Scholar 

  14. Gadducci, F., Santini, F.: Residuation for bipolar preferences in soft constraints. Inf. Process. Lett. 118, 69–74 (2017)

    Article  MathSciNet  Google Scholar 

  15. Gadducci, F., Santini, F., Pino, L.F., Valencia, F.D.: Observational and behavioural equivalences for soft concurrent constraint programming. J. Log. Algebraic Methods Program. 92, 45–63 (2017)

    Article  MathSciNet  Google Scholar 

  16. Galler, B.A.: Cylindric and polyadic algebras. Proc. Am. Math. Soc. 8(1), 176–183 (1957)

    Article  MathSciNet  Google Scholar 

  17. Giacobazzi, R., Debray, S.K., Levi, G.: A generalized semantics for constraint logic programs. In: FGCS 1992, pp. 581–591. IOS Press (1992)

    Google Scholar 

  18. Gilbert, D., Palamidessi, C.: Concurrent constraint programming with process mobility. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 463–477. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44957-4_31

    Chapter  Google Scholar 

  19. Golan, J.: Semirings and Affine Equations over Them. Kluwer (2003)

    Google Scholar 

  20. Guzmán, M., Haar, S., Perchy, S., Rueda, C., Valencia, F.D.: Belief, knowledge, lies and other utterances in an algebra for space and extrusion. J. Log. Algebraic Methods Program. 86(1), 107–133 (2017)

    Article  MathSciNet  Google Scholar 

  21. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55719-9_114

    Chapter  Google Scholar 

  22. Olarte, C., Rueda, C., Valencia, F.D.: Models and emerging trends of concurrent constraint programming. Constraints 18(4), 535–578 (2013)

    Article  MathSciNet  Google Scholar 

  23. Réty, J.: Distributed concurrent constraint programming. Fund. Inform. 34(3), 323–346 (1998)

    MathSciNet  MATH  Google Scholar 

  24. Sági, G.: Polyadic algebras. In: Andréka, H., Ferenczi, M., Németi, I. (eds.) Cylindric-like Algebras and Algebraic Logic. BSMS, vol. 22, pp. 367–389. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-35025-2_18

    Chapter  Google Scholar 

  25. Saraswat, V.A., Rinard, M.C., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Wise, D.S. (ed.) POPL 1991, pp. 333–352. ACM Press (1991)

    Google Scholar 

  26. Scott, A.D., Sorkin, G.B.: Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. ACM Trans. Algorithms 5(4), 45:1–45:27 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    Laura Bussi & Fabio Gadducci

  2. Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Perugia, Italy

    Francesco Santini

Authors
  1. Laura Bussi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabio Gadducci
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesco Santini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fabio Gadducci .

Editor information

Editors and Affiliations

  1. Istituto di Scienza e Tecnologie dell'In, Pisa, Italy

    Maurice H. ter Beek

  2. Mälardalen University, Västerås, Sweden

    Marjan Sirjani

Rights and permissions

Reprints and permissions

Copyright information

© 2022 IFIP International Federation for Information Processing

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bussi, L., Gadducci, F., Santini, F. (2022). Soft Concurrent Constraint Programming with Local Variables. In: ter Beek, M.H., Sirjani, M. (eds) Coordination Models and Languages. COORDINATION 2022. IFIP Advances in Information and Communication Technology, vol 13271. Springer, Cham. https://doi.org/10.1007/978-3-031-08143-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-08143-9_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-08145-3

  • Online ISBN: 978-3-031-08143-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation