Abstract
The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog interpreters. We propose a new semantics for Prolog programs based on a new fourvalued logic. The semantics is based on a new concept of completion analogous to Clark's and it enjoys the nice properties of the declarative semantics of logic programming: existence of the minimal Herbrand model, equivalence of the model-theoretic and operational semantics.
Work partially supported by the EEC Keep in Touch activity KIT011 — LPKRR.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J.H. Andrews. The Logical Structure of Sequential Prolog. In S. Debray and M. Hermenegildo, editors, Proc. 1990 North American Conf. on Logic Programming, 585–602. The MIT Press, Cambridge, Mass., 1990.
J.H. Andrews. A Logical Semantics for Depth-first Prolog with Ground Negation. In D. Miller, editor, Proc. 1993 Int'l. Symp. on Logic Programming, 220–234. The MIT Press, Cambridge, Mass., 1993.
K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, 495–574. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.
B. Arbab and D.M. Berry. Operational and Denotational Semantics of Prolog. Journal of Logic Programming, 4:309–330, 1987.
R. Barbuti, M. Codish, R. Giacobazzi, and G. Levi. Modelling Prolog Control. Journal of Logic and Computation, 3:579–603, 1993.
R. Barbuti, M. Codish, R. Giacobazzi, and M. Maher. Oracle Semantics for Prolog. to appear in Information and Computation.
A. Bossi, M. Bugliesi, and M. Fabris. A New Fixpoint Semantics for Prolog. In Proc. of the Tenth Int. Conference on Logic Programming, 374–389. MIT Press, 1993.
E. Börger, and D. Rosenzweig. A Mathematical Definition of Full Prolog. Science of Computer Programming, 1994, (to appear).
A. de Bruin and E. de Vink. Continuation semantics for Prolog with cut. In J. Diaz and F. Orejas, editors, Proc. CAAP 89, volume 351 of Lecture Notes in Computer Science, 178–192. Springer-Verlag, Berlin, 1989.
D. Cerrito. A Linear Axiomatization of Negation as Failure. Journal of Logic Programming, 12:1–24, 1992.
K.L. Clark. Negation as Failure. In Logic and Databases, 293–322, Plenum Press, New York, 1978.
S. K. Debray and P. Mishra. Denotational and Operational Semantics for Prolog. In M. Wirsing, editor, Formal Description of Programming Concepts III, 245–269. North-Holland, Amsterdam, 1987.
Epstein G.. The Lattice Theory of Post Algebras. In D.C. Rine, editor, Computer Science and Multiple-valued Logic, 23–40. North-Holland, Amsterdam, 1984. Reprinted from Transaction of the American Math. Society, 95, 2:300–317, 1960.
M. Fitting. A Kripke-Kleene Semantics for Logic Programs. Journal of Logic Programming, 4:295–312, 1985.
M. Fitting. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11:91–116, 1991.
K. Kunen Negation in Logic Programming. Journal of Logic Programming, 4:298–308, 1987.
N.D. Jones and A. Mycroft. Stepwise Development of Operational and Denotational Semantics for Prolog. In Sten-Åke Tärnlund, editor, Proc. Second Int'l Conf. on Logic Programming, 281–288, 1984.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.
A. Mycroft. Logic Programs and Multy-valued Logic. In M. Fontet and K. Mehlhorn, editors, Proc. STAGS 84, volume 166 of Lecture Notes in Computer Science, 274–286. Springer-Verlag, Berlin, 1984.
D. Miller, G. Nadathur, F. Pfenning, and A.Scedrow. Uniform Proofs as a Foundation for Logic Programming. Annals of Pure and Applied Logic, 51:125–157, 1991.
M. Rayan and M. Sadler. Valuation Systems and Consequence Relations. In S. Abramsky, D.M. Gabbay and T.S.E. Maibaum eds., Handbook of Logic in Computer Science, Vol. I, Clarendon Press, Oxford, 1–78, 1992.
W.R. Smith. Minimization of Multivalued Functions. In D.C. Rine, editor, Computer Science and Multiple-valued Logic, 227–267. North-Holland, Amsterdam, 1984.
Special Section on Multiple-valued Logic. IEEE Trans. on Computers, C-30:617–706, 1981.
R.F. Stärk. The Declarative semantics of the prolog Selection Rule. In Proc. Ninth IEEE Symp. on Logic in Computer Science, Paris, 252–261, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbuti, R., Mancarella, P. (1996). A multiple-valued logical semantics for Prolog. In: Nielson, H.R. (eds) Programming Languages and Systems — ESOP '96. ESOP 1996. Lecture Notes in Computer Science, vol 1058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61055-3_29
Download citation
DOI: https://doi.org/10.1007/3-540-61055-3_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61055-7
Online ISBN: 978-3-540-49942-8
eBook Packages: Springer Book Archive