Abstract
We propose a purely extensional semantics for higher-order logic programming. Under this semantics, every program has a unique minimum Herbrand model which is the greatest lower bound of all Herbrand models of the program and the least fixed-point of the immediate consequence operator of the program. We also propose an SLD-resolution proof procedure which is sound and complete with respect to the minimum model semantics. In other words, we provide a purely extensional theoretical framework for higher-order logic programming which generalizes the familiar theory of classical (first-order) logic programming.
This work has been partially supported by the University of Athens under the project “Kapodistrias” (grant no. 70/4/5827).
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
Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science III. Clarendon Press, Oxford (1994) (expanded version)
Bezem, M.: Extensionality of Simply Typed Logic Programs. In: International Conference on Logic Programming (ICLP), pp. 395–410 (1999)
Chen, W.C., Kifer, M., Warren, D.S.: HILOG: A Foundation for Higher-Order Logic Programming. J. of Logic Programming 15(3), 187–230 (1993)
Kiselyov, O., Shan, C.C., Friedman, D.P., Sabry, A.: Backtracking, Interleaving, and Terminating Monad Transformers. In: International Conference on Functional Programming (ICFP), pp. 192–203 (2005)
Lloyd, J.: Foundations of Logic Programming. Springer, Heidelberg (1987)
Nadathur, G., Miller, D.: Higher-Order Logic Programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logics for Artificial Intelligence and Logic Programming, pp. 499–590. Clarendon Press, Oxford (1998)
Wadge, W.W.: Higher-Order Horn Logic Programming. In: Proceedings of the International Symposium on Logic Programming, pp. 289–303 (1991)
Warren, D.H.D.: Higher-Order Extensions to Prolog: are they needed? Machine Intelligence 10, 441–454 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Charalambidis, A., Handjopoulos, K., Rondogiannis, P., Wadge, W.W. (2010). Extensional Higher-Order Logic Programming. In: Janhunen, T., Niemelä, I. (eds) Logics in Artificial Intelligence. JELIA 2010. Lecture Notes in Computer Science(), vol 6341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15675-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-15675-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15674-8
Online ISBN: 978-3-642-15675-5
eBook Packages: Computer ScienceComputer Science (R0)