Abstract
The paper aims at a semantic study of the integration of blackboards in logic programming. To that end, a new logic programming framework involving Lindalike primitives is proposed first. It is dedicated to no particular logic language but rather focuses on the key concepts and control operators. As natural consequences, it subsumes existing concrete proposals ([2, 4, 5]) and provides a general framework well-suited for their semantic analysis.
Five semantics are described and compared. They range in the operational, declarative and denotational types and are issued both from the logic programming and the imperative traditions. They are composed of two operational semantics, describing respectively the success/failure sets, and various failures, of two declarative semantics, extending the classical Herbrand interpretation and immediate consequence operator, and of one denotational semantics, defined compositionally and on the basis of process-like histories. The mathematical tools mainly used are complete lattices and complete metric spaces.
The first author is supported by the Belgian National Fund for Scientific Research as a Research Assistant. Part of this work was carried out when the second author was participating at CWI (Amsterdam, The Netherlands) in the ESPRIT Basic Research Action (3020) Integration.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. America and J.J.M.M. Rutten. Solving reflexive domain equations in a category of complete metric spaces. Journal of Computer and System Sciences, 39(3):343–375, 1989.
S. Andersson. Linda primitives in Sicstus Prolog, Personal Communication, 1991.
N.J. Aparico, J. Cunha, L. Monteiro, and L.M. Pereira. Delta-Prolog: a Distributed Backtracking Extension with Events. In E. Shapiro, editor, Proc. 3 rd Int. Conf. on Logic Programming, volume 225 of Lecture Notes in Computer Science, pages 225–260, London, United Kingdom, 1986. Springer-Verlag.
K. De Bosschere. Multi-Prolog, Another Approach for Parallelizing Prolog. In D.J. Evans, G.R. Joubert, and F.J. Peters, editors, Proceedings of Parallel Computing, pages 443–448, Leiden, 1989. Elsevier, North Holland.
A. Brogi and P. Ciancarini. The Concurrent Language Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1):99–123, January 1991.
W.F. Clocksin and C.S. Mellish. Programming in Prolog. Springer-Verlag, 1981.
J.W. de Bakker. Comparative Semantics for Flow of Control in Logic Programming without Logic. Information and Computation, 94(2):123–179, October 1991.
J.W. de Bakker and J.I. Zucker. Processes and the Denotational Semantics of Concurrency. Information and Control, 54:70–120, 1982.
P. Degano and U. Montanari. Concurrent Histories: a Basis for Observing Distributed Systems. Journal of Computer and System Sciences, 34(3):422–461, june 1987.
R. Engelking. General Topology. Heldermann Verlag, 1989.
I. Foster and S. Taylor. Strand:New Concepts in Parallel Programming. Prentice-Hall, Englewood Cliffs, 1989.
D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, January 1989.
S. Gregory. Design, Application and Implementation of a Parallel Logic Programming Language. PhD thesis, Department of Computing, Imperial College, London, Great-Britain, 1985.
J.N. Kok and J.J.M.M. Rutten. Contractions in Comparing Concurrency Semantics. Theoretical Computer Science, 76:179–222, 1990.
J. Levy. Shared Memory Execution of Committed-Choice Languages. In E. Shapiro, editor, Proc. 3 rd Int. Conf. on Logic Programming, volume 225 of Lecture Notes in Computer Science, pages 298–312, London, United Kingdom, 1986. Springer-Verlag.
Y.-J. Lin and V. Kumar. And-parallel Execution of Logic Programs on a Shared Memory Multiprocessor: a Summary of Results. In R.A. Kowalski and K.A. Bowen, editors, Proc. 5 th Int. Conf. and Symp. on Logic Programming, pages 1123–1141, Seattle, USA, 1988. The MIT Press.
J.W. Lloyd. Foundations of logic programming. Springer-Verlag, second edition, 1987.
L. Monteiro. Distributed Logic, A Theory of Distributed Programming in Logic. Research report, Departamento de Informática, Universidade de Lisboa, 2885 Monte da Caparica, Lisbon, Portugal, 1986.
G. Plotkin. A structured approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.
D. Ripps. An Implementation Guide to Real-Time Programming. Prentice Hall, 1989.
V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, 1989. To be published by The MIT Press.
E.Y. Shapiro. A Subset of Concurrent Prolog and its Interpreter. Technical Report TR-003, Institute for New Generation Computer Technology (ICOT), Tokyo, 1983.
K. Ueda. Guarded Horn Clauses. PhD thesis, Faculty of Engineering, University of Tokyo, Tokyo, Japan, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Bosschere, K., Jacquet, JM. (1992). Comparative semantics of μLog. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_132
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_132
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive