Abstract
We provide here a framework for studying Prolog programs with various built-in's that include arithmetic operations, and such metalogical relations like var and ground. To this end we propose a new, declarative semantics and prove completeness of the Prolog computation mechanism w.r.t. this semantics. Finally, we provide a method for proving termination of Prolog programs with built-in's which uses this semantics. The method is shown to be modular.
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. R. Apt and D. Pedreschi. Proving termination of general Prolog programs. In T. Ito and A. Meyer, editors, Proceeding of the International Conference on Theoretical Aspects of Computer Software, Lecture Notes in Computer Science 526, pages 265–289, Berlin, 1991. Springer-Verlag.
K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493–574. Elsevier, 1990. Vol. B.
E. Börger. A logical operational semantics of full Prolog, Part III: Built-in predicates for files, terms, arithmetic and input-output. In Y.Moschovakis, editor, Proceedings Workshop on Logic from Computer Science, Springer MSRI Publications, 1989.
K.L. Clark. Predicate logic as a computational formalism. Res. Report DOC 79/59, ico, London, 1979.
P. Deransart and G. Ferrand. Aa operational formal definition of Prolog. In Proceedings of the 4th Symposium on Logic Programming, pages 162–172. Computer Society Press, 1987.
P.M. Hill and J.W. Lloyd. Analysis of meta-programs. In H.D. Abramson and M.H. Rogers, editors, Proceedings of the Meta88 Workshop, pages 23–52. MIT Press, 1988.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, second edition, 1987.
M. Martelli M.Falaschi, G. Levi and C. Palamidessi. Declarative modeling of the operational behaviour of logic languages. Theoretical Computer Science, 69:289–318, 1989.
L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.
M.H. van Emden and R.A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23:733–742, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Apt, K.R., Marchiori, E., Palamidessi, C. (1992). A theory of first-order built-in's of prolog. In: Kirchner, H., Levi, G. (eds) Algebraic and Logic Programming. ALP 1992. Lecture Notes in Computer Science, vol 632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013820
Download citation
DOI: https://doi.org/10.1007/BFb0013820
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55873-6
Online ISBN: 978-3-540-47302-2
eBook Packages: Springer Book Archive