Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Programming Language Implementation and Logic Programming

PLILP 1991: Programming Language Implementation and Logic Programming pp 407–418Cite as

Constraints for synchronizing coarse-grained sequential logic processes

  • Session: Constraint Logic Programming
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 528))

Abstract

We present a constraint based language designed to support the parallel execution of sequential logic theories. Each sequential computation is embedded in a (coarse-grained) process. According to the concurrent constraint paradigm, the parallel execution of processes is performed by using constraints for inter-process communication and synchronization. The operational semantics of the language is modelled according to the true concurrency approach.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Bahgat and S. Gregory. Pandora: Non-deterministic Parallel Logic Programming. In G. Levi and M. Martelli, editors, Proc. Sixth Int'l Conf. on Logic Programming, pages 471–486. The MIT Press, Cambridge, Mass., 1989.

    Google Scholar 

  2. A. Brogi and P. Ciancarini. The Concurrent Language Shared Prolog. ACM Transactions on Programming Languages and Systems, 1(1), 1991.

    Google Scholar 

  3. A. Brogi, R. Filippi, M. Gaspari, and F. Turini. An Expert System for Data Fusion based on a Blackboard Architecture. In Proc. of Eight Int'l Workshop on Expert Systems and their Applications, pages 147–166, Avignon, 1988.

    Google Scholar 

  4. A. Brogi and R. Gorrieri. A Distributed, Net Oriented Semantics for Delta Prolog. In J. Diaz and F. Orejas, editors, Proc. of TAPSOFT-CAAP'89, volume 351 of Lecture Notes in Computer Science, pages 637–654. The MIT Press, Cambridge, Mass., 1989.

    Google Scholar 

  5. P. Degano and U. Montanari. Concurrent Histories: a Basis for Observing Distributed Systems. Journal of Computer and System Science, 34:442–461, 1987.

    Google Scholar 

  6. R. Engelmore and T. Morgan. Blackboard Systems. Addison-Wesley, 1988.

    Google Scholar 

  7. M. Gabbrielli and G. Levi. Unfolding and Fixpoint Semantics of Concurrent Constraint Programs. In H. Kirchner and W. Wechler, editors, Proc. Second Int'l Conf. on Algebraic and Logic Programming, volume 463 of Lecture Notes in Computer Science, pages 204–216. Springer-Verlag, Berlin, 1990. Extended version to appear in Theoretical Computer Science.

    Google Scholar 

  8. M. Gabbrielli and G. Levi. Modeling Answer Constraints in Constraint Logic Programs. In K. Furukawa, editor, Proc. Eighth Int'l Conf. on Logic Programming. The MIT Press, Cambridge, Mass., 1991.

    Google Scholar 

  9. S. Haridi and S. Janson. Kernel Andorra Prolog and its computation model. In D. H. D. Warren and P. Szeredi, editors, Proc. Seventh Int'l Conf. on Logic Programming, pages 31–48. The MIT Press, Cambridge, Mass., 1990.

    Google Scholar 

  10. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. In Proc. Fourteenth Annual ACM Symp. on Principles of Programming Languages, pages 111–119. ACM, 1987.

    Google Scholar 

  11. J. Jaffar and J.-L. Lassez. Constraint Logic Programming. Technical report, Department of Computer Science, Monash University, June 1986.

    Google Scholar 

  12. G. Plotkin. A structured approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  13. V. A. Saraswat. GHC: operational semantics, problems and relationship with CP (↓, ¦). In IEEE Int'l Symp. on Logic Programming, pages 347–358. IEEE, 1987.

    Google Scholar 

  14. V. A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1989.

    Google Scholar 

  15. V. A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. Seventeenth Annual ACM Symp. on Principles of Programming Languages. ACM, 1990.

    Google Scholar 

  16. E. Y. Shapiro. The family of concurrent logic programming languages. ACM Computing Surveys, 21(3):412–510, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Antonio Brogi & Maurizio Gabbrielli

Authors
  1. Antonio Brogi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurizio Gabbrielli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Maluszyński Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brogi, A., Gabbrielli, M. (1991). Constraints for synchronizing coarse-grained sequential logic processes. In: Maluszyński, J., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1991. Lecture Notes in Computer Science, vol 528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54444-5_116

Download citation

  • DOI: https://doi.org/10.1007/3-540-54444-5_116

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54444-9

  • Online ISBN: 978-3-540-38362-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation