Abstract
The notions of compositionality and equivalence are fundamental questions in programming language semantics. We focus on these notions and study the semantics of logic programs in the setting of a graph model. We represent a logic program by a graph model, we derive some semantics related to the well-known classic semantics of logic programs (success set, computed answer substitution set and finite failure set). Furthermore we consider the set of partial computations, and prove that is compatible with the set of logic consequences of the program. A simulation equivalence with silent (or invisible) steps on these graphs is also considered, we show that the subsumption equivalence defined on logic programs is compatible with this τ-simulation equivalence. Finally, we prove that the τ-simulation equivalence is a congruence w.r.t two graph combining operators which are the counterpart of the union and hiding operators respectively defined on logic programs.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Brogi, P. Mancarella, D. Pedreschi, F. Turini. Composition operators for logic theories. Computational logic. Symp.proceedings. Brussels, nov 1990.
H. Gaifman, E. Shapiro. Fully abstract compositional semantics for logic programs. 6th annual ACM symp. of POPL. Jan. 1989.
H. Gaifman, E. Shapiro. Proof theory and semantics of logic programs. 4th IEEE annual symp. on LICS. pp 50–62. 1989.
M.J.Maher. Semantics of logic programs. Ph.D.dissertation, University of Melbourne, 1985.
A. Corradini. An algebraic semantics for transition systems and logic programing. Ph.D Thesis, Dipermento di informatica, università di Pisa, Dec, 1989.
A. Corradini, U. Montanari. Towards a process semantics in logic programming style. LNCS 415
R.Gerth, M.Codish, Y.Lichtenstein and E. Shapiro. Fully abstract denotational semantics for Flat concurrent Prolog. 3th IEEE annual symp. on LICS. pp 320–335. 1988.
J.Kok. Specialization in logic programming: from Horn Clause Logic to Prolog and Concurrent Prolog. LNCS 430.
V.A. Saraswat. The concurrent logic programming language CP: Definition and operational semantics. 4th annual ACM symp. on POPL. pp 49–62. 1987.
J.W.Lloyd. Foundations of logic programming. Springer Verlag, New York. 1987.
P.Mancarella, D. Pedreschi. An algebra of logic programs. In Proc. of 5th int. conf Symp. of logic Programming, 1988.
M.J.Maher. Equivalences of logic programs. In J. Minker (ed.), Foundations of Deductive Databases and Logic programming, pp. 627–658, Morgan Kaufmann Publishers, Los Altos. 1987.
D.M.R.Park. Concurrency and automata on infinite sequences. In Proc. 5th GI conf LNCS 104.pp 167–183.
M.Hennessy, R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1). pp 137–161. 1985.
M.Falaschi, G. Levi, M. Martelli, C. Palamidessi. Declarative Modeling of the Operational Behaviour of Logic Languages. In Proc. 5th Int. Conf. Symp. on Logic Programming, Seattle, MIT Press, pp. 993–1005, 1988.
R.J. Van Glabbeeck. Comparative Concurrency Semantics and Refinement of Actions. PhD dissertation, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belmesk, M. (1992). A process semantics of logic programs. In: Voronkov, A. (eds) Logic Programming. Lecture Notes in Computer Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55460-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-55460-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55460-8
Online ISBN: 978-3-540-47083-0
eBook Packages: Springer Book Archive