Abstract
This paper attempts a direct semantic formalization of first-order relational-functional languages (the characteristic RELFUN subset) in terms of a generalized model concept. Function-defining conditional equations (or, footed clauses) and active call-by-value expressions (in clause premises) are integrated into first-order theories. Herbrand models are accomodated to relational-functional programs by not only containing ground atoms but also ground molecules, i.e. specific function applications paired with values. Extending SLD-resolution toward innermost conditional narrowing of relational-functional clauses, SLV-resolution is introduced, which, e.g., flattens active expressions. The T P-operator is generalized analogously, e.g. by unnesting ground-clause premises. Soundness and completeness proofs for SLV-resolution naturally extend the corresponding results in logic programming.
This research was supported by the BMFT under Grant ITW 8902 C4.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Bellia and G. Levi. The relation between logic and functional languages: A survey. Journal of Logic Programming, 3:217–236, 1986.
Harold Boley. A relational/functional language and its compilation into the WAM. Technical Report SEKI SR-90-05, University of Kaiserslautern, Department of Computer Science, April 1990.
Harold Boley. Extended Logic-plus-Functional Programming. In Workshop on Extensions of Logic Programming, ELP '91, Stockholm 1991, LNAI. Springer, 1992.
D. DeGroot and G. Lindstrom, editors. Logic Programming: Functions, Relations, and Equations. Prentice-Hall, 1986.
Laurent Fribourg. SLOG: A logic programming language interpreter based on clausal superposition and rewriting. In 1985 Symposium on Logic Programming, pages 172–184. IEEE Computer Society Press, 1985.
E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel-LEAF: A logic plus functional language. Journal of Computer and System Sciences, 42:139–185, 1991.
John W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, Heidelberg, New York, 1987.
J.J. Moreno-Navarro and M. Rodriguez-Artalejo. Logic programming with functions and predicates: The language BABEL. Journal of Logic Programming, 12:191–223, 1992.
M. J. O'Donnell. Equational Logic as a Programming Language. MIT Press, Cambridge, Mass., 1985.
David H. D. Warren. Higher-order extensions to PROLOG: Are they needed? Machine Intelligence, 10:441–454, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boley, H. (1993). A direct semantic characterization of RELFUN. In: Lamma, E., Mello, P. (eds) Extensions of Logic Programming. ELP 1992. Lecture Notes in Computer Science, vol 660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56454-3_7
Download citation
DOI: https://doi.org/10.1007/3-540-56454-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56454-6
Online ISBN: 978-3-540-47562-0
eBook Packages: Springer Book Archive