Abstract
In this chapter, we describe the operational interpretation of Prolog programs. More precisely, we describe how a Prolog interpreter solves goals in the context of a given program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
J.A. Robinson, A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23–41 (1965)
A. Martelli, U. Montanari, An efficient unification algorithm. Trans. Program. Lang. Syst. 4(2), 258–282 (1982)
P. Blackburn, J. Bos, K. Striegnitz, Learn Prolog now, Texts in Computing (Vol. 7) (College Publications, 2007)
C.J. Hogger, Introduction to Logic Programming, APIC Studies in Data Processing (Academic Press, London, 1984)
W.F. Clocksin, C.S. Mellish, Programming in Prolog, 4th edn. (Springer, New York, 1994)
P. Roussel, PROLOG: Manuel de Référence et d’utilisation. Research Report, Artificial Intelligence Team, University of Aix-Marseille, France (1975)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this chapter
Cite this chapter
Fernández, M. (2014). Operational Semantics of Prolog. In: Programming Languages and Operational Semantics. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-6368-8_8
Download citation
DOI: https://doi.org/10.1007/978-1-4471-6368-8_8
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-6367-1
Online ISBN: 978-1-4471-6368-8
eBook Packages: Computer ScienceComputer Science (R0)