Skip to main content
SpringerLink
Log in

A Distributed and Probabilistic Concurrent Constraint Programming Language

  • Conference paper
Book cover Logic Programming (ICLP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3668))

Included in the following conference series:

Abstract

We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and independent constraint store. While locally the computations evolve asynchronously, following the usual rules of (probabilistic) CCP, the communications among different nodes are synchronous. There are channels, and through them different objects can be exchanged: constraints, agents and channel themselves. In addition, all this activities are embedded in a probabilistic scheme based on a discrete model of time, both locally and globally. Finally we enhance the language with the capability of performing an automatic remote synchronization of variables belonging to different constraint stores.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. de Boer, F.S., van Eijk, R.M., van der Hoek, W., Meyer, J.-J.C.: Failure semantics for the exchange of information in multi-agent systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, p. 214. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. de Boer, F.S., Di Pierro, A., Palamidessi, C.: Nondeterminism and infinite computations in constraint programming. Theoretical Computer Science 151(1) (1995)

    Google Scholar 

  3. De Nicola, R., Ferrari, G., Pugliese, R.: Klaim: a kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering 24(5), 315–330 (1998)

    Article  Google Scholar 

  4. Di Pierro, A., Wiklicky, H.: A banach space based semantics for probabilistic concurrent constraint programming. In: Proceedings of CATS 1998 (1998)

    Google Scholar 

  5. Di Pierro, A., Wiklicky, H.: An operational semantics for probabilistic concurrent constraint programming. In: Proceedings of IEEE Computer Society International Conference on Computer Languages (1998)

    Google Scholar 

  6. Di Pierro, A., Wiklicky, H.: Probabilistic abstract interpretation and statistical testing. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, p. 211. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Di Pierro, A., Wiklicky, H., Hankin, C.: Quantitative static analysis of distributed systems. Journal of Functional Programming (to appear)

    Google Scholar 

  8. Gilbert, D., Palamidessi, C.: Concurrent constraint programming with process mobility. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, p. 463. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Rety., J.H.: Distributed concurrent constraint programming. Fundamentae Informaticae 34(3), 323–346 (1998)

    MathSciNet  Google Scholar 

  10. Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras, Part I. North-Holland, Amsterdam (1971)

    Google Scholar 

  11. Herescu, O.M., Palamidessi, C.: Probabilistic asynchronous π-calculus. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 146–160. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Brim, L., Gilbert, D., Jacquet, J., Kretinsky, M.: Multi-agent systems as concurrent constraint processes. In: Pacholski, L., Ružička, P. (eds.) SOFSEM 2001. LNCS, vol. 2234, p. 201. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Milano, M., Roli, A.: Magma: A multiagent architecture for metaheuristics. IEEE Trans. on Systems, Man and Cybernetics - Part B 34(2) (2004)

    Google Scholar 

  14. Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Springer, Heidelberg (1994)

    Google Scholar 

  15. Priami, C.: Stochastic π-calculus. Computer Journal 38(7), 578–589 (1995)

    Article  Google Scholar 

  16. Resende, M., Pardalos, P., Ekşiog̃lu, S.D.: Parallel metaheuristics for combinatorial optimization. In: Correa, R., et al. (eds.) Models for Parallel and Distributed Computation - Theory, Algorithmic Techniques and Applications, pp. 179–206. Kluwer Academic, Dordrecht (2002)

    Google Scholar 

  17. Saraswat, V.A.: Concurrent Constraint Programming. MIT Press, Cambridge (1993)

    Google Scholar 

  18. Saraswat, V.A., Rinard, M., Panangaden, P.: Semantics foundations of concurrent constraint programming. In: Proceedings of POPL (1991)

    Google Scholar 

  19. Shields, P.C.: The Ergodic Theory of Discrete Sample Paths. Graduate Studies in Mathematics, vol. 13. American Mathematical Society, Providence (1996)

    MATH  Google Scholar 

  20. Van Roy, P., Haridi, S., Brand, P., Smolka, G., Mehl, M., Scheidhauer, R.: Mobile objects in distributed oz. ACM Transactions on Programming Languages and Systems 19(5), 804–851 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. of Maths and Computer Science, University of Udine, Udine, Italy

    Luca Bortolussi

  2. Dep. of Computing, Imperial College, London, UK

    Herbert Wiklicky

Authors
  1. Luca Bortolussi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Herbert Wiklicky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università di Bologna, Italy

    Maurizio Gabbrielli

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX

    Gopal Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bortolussi, L., Wiklicky, H. (2005). A Distributed and Probabilistic Concurrent Constraint Programming Language. In: Gabbrielli, M., Gupta, G. (eds) Logic Programming. ICLP 2005. Lecture Notes in Computer Science, vol 3668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562931_13

Download citation

  • DOI: https://doi.org/10.1007/11562931_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29208-1

  • Online ISBN: 978-3-540-31947-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation