Abstract
In this paper, we propose new notions related to unfolding semantics which clarify the relationship between procedural and fixpoint semantics of logic programs. We introduce 3 main new ideas:
-
the unfolding rule has an associativity property that ensures the adequacy of unfolding semantics with the procedural semantics
-
the uniformly fair computation rules which guarantees strong procedural equivalences
-
the notion of operator compatible with unfolding which provides the connection between the unfolding and fixpoint semantics and gives new tools for proving old and new results of equivalence between procedural and fixpoints semantics of logic programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. APT and M. VAN EMDEN, Contribution to the Theory of Logic Programming, Journal of the Association for Computing Machinery, 29.3, 1982, p. 841–862.
K. L. CLARK, Negation as Failure. Logic and Data Bases, H. GALLAIRE and J. MINKER ed., Plenum Press, New York, 1978, p. 293–324.
J.-P. DELAHAYE, Sémantique Logique et Dénotationnelle des Interprèteurs Prolog, Informatique Théorique et Applications, vol 22, no1, 1988, p. 3–42.
F. DENIS, Approximations de la sémantique opérationnelle d'un interprèteur Prolog Standard par des sémantiques axiomatiques, Rapport de recherche, septembre 1989, Laboratoire d'Informatique Fondamentale de Lille, Bât. M3, Université des Sciences et Techniques de Lille, 59655 Villeneuve d'Ascq, CEDEX.
F. DENIS, Contribution à l'étude des sémantiques axiomatiques de Prolog, Nouvelle thèse, LIFL, Bât. M3, Université des Sciences et Techniques de Lille, 59655 Villeneuve d'Ascq, CEDEX.
P. DERANSART, G. FERRAND, Programmation en Logique avec Négation: Présentation Formelle, INRIA-Université d'Orléans, Faculté des Sciences, BP 6759, 45067 ORLEANS Cédex 2.
M. H. VAN EMDEN et R. A. KOWALSKI, The Semantics of Predicate Logic as a Programming Language, Journal of the Association for Computing Machinery, vol. 23-4, 1976, p 733–742.
M. FALASCHI, G. LEVI, C. PALAMIDESSI, Declarative Modeling of the Operational Behavior of Logic Languages, Theorical Computer Science 69 (1989) 289–318, North-Holland.
T. KANAMORI, K. HORIUCHI, Construction of Logic programs Based on Generalized Unfold/Fold Rules, Proc. 4th Int. Conf. on Logic Programming, The MIT Press, Series in Logic Programming (1988).
K. KANCHANASUT, P. STUCKEY, Eliminating negation from normal logic programs, Department of Computer Science, University of Melbourne, Parkville 3052, Australia.
J.L. LASSEZ, M.J. MAHER, Closures and Fairness in Semantics of Programming Logic, T.C.S., 29, 1984, p. 167–184.
G.LEVI, P. MANCARELLA, The Unfolding Semantics of Logic Programs, Technical report-13/88, Università degli Studi di Pisa, Dipartimento di Informatica.
J.W. LLOYD, Foundations of Logic Programming, Springer-Verlag (1984).
J.W. LLOYD, J.C. SHEPHERDSON, Partial evaluation in Logic Programming. Technical report CS-87-09, Dept. of Computer Science, University of Bristol (1987).
H. SEKI, Unfold/Fold Transformation of Stratified Programs, Extended Abstract, Institute for New Generation Computer Technology, 1-4-28, Mita, Minato-ku, Tokyo 108, JAPAN.
H. TAMAKI, T. SATO, Unfold/Fold Transformation of Logic Programs, Proc. 2th Int. Conf. on Logic Programming (1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Denis, F., Delahaye, JP. (1991). Unfolding, procedural and fixpoint semantics of logic programs. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020825
Download citation
DOI: https://doi.org/10.1007/BFb0020825
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53709-0
Online ISBN: 978-3-540-47002-1
eBook Packages: Springer Book Archive