Abstract
Clark and Tärnlud4 have proposed a methodology for the specification, desing and verification of logic programs in the framework of first order logic. Their main idea is to derive the correctness of a logic program from its own clauses and suitable induction axioma on the data. This approach has been also advocated by Cartwright3 for the case of recursive, functional programs. He has contributed some theoretical results about the semantics of programs in nonstandard structures, using the notion of least definable fixpoint of the operator naturally associated to a given recursive program: This idea is also implicit in the independent work of Andréka, Németi and Sain1 and Hajék7 about nonstandard dynamic logic for flowchart-like programs and regular programs; see also Sain10.
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
Preview
Unable to display preview. Download preview PDF.
References
Andréka, H., I. Németi and I. Sain, A Complete Logic for Reasoning about Programs via Nonstandard Model Theory, Parts I and II, TCS 17 (1982), 193–212.
Andréka, H., I. Németi and I. Sain, A Complete Logic for Reasoning about Programs via Nonstandard Model Theory, Parts I and II, TCS 17 (1982), 259–278.
Apt, K.R. and M.H. van Emden, Contributions to the Theory of Logic Programming, J.ACM 29(1982), 841–862.
Cartwright, R., Recursive Programs as Definitions in First Order Logic, SIAM J. on Computing 13(1984), 374–408.
Clark, K.L. and S.A. Tärnlud, A First Order Theory of Data and Programs Proceedings IFIP’77, North-Holland (1977), 939–944.
Fribourg, L., Oriented Equational Clauses as a Programming Language, Procedings ICALP’84, Lecture Notes in Comp. Sci. 172(1984), 162–173.
van Emden, M.A. and R.A. Kowalski, The Semantics of Predicate Logic as a Programming Language, J.ACM 23(1976), 733–742.
Hajék, P., Making Dynamic Logic Firts Order, in Mathematical Foundations of Comp. Sci., Lecture Notes in Comp. Sci. 118(1981), 287–295.
Lloyd, J.W., Foundations Of Logic Programming, Springer Verlag (1984).
Robinson, J.A. and E.E. Sibert, LOGLISP: and alternative to PROLOG, in Machine Intelligence 10, J. Wiley & Sons (1982), 399–419.
Sain, I., Structured Nonstandard Dynamic Logic, ZMLGM 30(1984), 481–497.
Scott, D.S., Outline of a Mathematical Theory of Computation,Tchn. Monograph PRG-2, Oxford University Computing Laboratory (1970).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Plenum Press, New York
About this chapter
Cite this chapter
Navarro, J.J.M., Artalejo, M.R. (1987). A First Order Logic for Logic Programming. In: Skordev, D.G. (eds) Mathematical Logic and Its Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0897-3_22
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0897-3_22
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8234-1
Online ISBN: 978-1-4613-0897-3
eBook Packages: Springer Book Archive