Abstract
One approach to integrating first-order logic programming and neural network systems employs the approximation of semantic operators by feedforward networks. For this purpose, it is necessary to view these semantic operators as continuous functions on the reals. This can be accomplished by endowing the space of all interpretations of a logic program with topologies obtained from suitable embeddings. We will present such topologies which arise naturally out of the theory of logic programming, discuss continuity issues of several well-known semantic operators, and derive some results concerning the approximation of these operators by feedforward neural networks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Browne, A., Sun, R.: Connectionist inference models. Neural Networks 14, 1331–1355 (2001)
Hölldobler, S.: Challenge problems for the integration of logic and connectionist systems. In: Bry, F., Geske, U., Seipel, D., (eds.) Proceedings 14 Workshop Logische Programmierung. vol. 90 of GMD Report, GMD, pp. 161–171 (2000)
Hölldobler, S., Störr, H.P., Kalinke, Y.: Approximating the semantics of logic programs by recurrent neural networks. Applied Intelligence 11, 45–58 (1999)
Funahashi, K.I.: On the approximate realization of continuous mappings by neural networks. Neural Networks 2, 183–192 (1989)
Blair, H.A., Dushin, F., Jakel, D.W., Rivera, A.J., Sezgin, M.: Continuous models of computation for logic programs. In: Apt, K.R., Marek, V.W., Truszczyński, M., Warren, D.S. (eds.) The Logic Programming Paradigm: A 25-Year Persepective, pp. 231–255. Springer, Berlin (1999)
Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1988)
Willard, S.: General Topology. Addison-Wesley, Reading (1970)
Batarekh, A., Subrahmanian, V.: Topological model set deformations in logic programming. Fundamenta Informaticae 12, 357–400 (1989)
Seda, A.K.: Topology and the semantics of logic programs. Fundamenta Informaticae 24, 359–386 (1995)
Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S. (eds.) Handbook of Logic in Computer Science. vol. 3. Clarendon, Oxford (1994)
Hitzler, P.: Generalized Metrics and Topology in Logic Programming Semantics. PhD thesis, Department of Mathematics, National University of Ireland, University College Cork (2001)
Hitzler, P., Seda, A.K.: Generalized metrics and uniquely determined logic programs. Theoretical Computer Science (200x) (to appear)
Fitting, M.: Fixpoint semantics for logic programming — A survey. Theoretical Computer Science 278, 25–51 (2002)
Hitzler, P., Seda, A.K.: Semantic operators and fixed-point theory in logic programming. In: Proceedings of the joint IIIS & IEEE meeting of the 5th World Multiconference on Systemics, Cybernetics and Informatics, SCI 2001 and the 7th International Conference on Information Systems Analysis and Synthesis, ISAS 2001, Orlando, Florida, USA, International Institute of Informatics and Systemics: IIIS (2001)
Bartle, R.G.: The Elements of Integration. John Wiley & Sons, New York (1966)
Hitzler, P., Seda, A.K.: A note on relationships between logic programs and neural networks. In: Gibson, P., Sinclair, D., (eds.) Proceedings of the Fourth Irish Workshop on Formal Methods, IWFM 2000. Electronic Workshops in Comupting (eWiC), British Computer Society (2000)
Denecker, M., Marek, V.W., Truszczynski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In: Minker, J. (ed.) Logic-based Artificial Intelligence, pp. 127–144. Kluwer Academic Publishers, Boston (2000)
Fitting, M.: A Kripke-Kleene-semantics for general logic programs. The Journal of Logic Programming 2, 295–312 (1985)
Hitzler, P., Seda, A.K.: Characterizations of classes of programs by three-valued operators. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 357–371. Springer, Heidelberg (1999)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming. Proceedings of the 5th International Conference and Symposium on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Wendt, M.: Unfolding the well-founded semantics. Journal of Electrical Engineering, Slovak Academy of Sciences 53, 56–59 (2002); Proceedings of the 4th Slovakian Student Conference in Applied Mathematics, Bratislava (April 2002)
Bishop, C.M.: Neural Networks for Pattern Recognition. Oxford University Press, Oxford (1995)
Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Networks 2, 359–366 (1989)
Cavedon, L.: Acyclic programs and the completeness of SLDNF-resolution. Theoretical Computer Science 86, 81–92 (1991)
Fitting, M.: Metric methods: Three examples and a theorem. The Journal of Logic Programming 21, 113–127 (1994)
Bader, S.: From logic programs to iterated function systems. Master’s thesis, Department of Computer Science, Dresden University of Technology (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hitzler, P., Seda, A.K. (2003). Continuity of Semantic Operators in Logic Programming and Their Approximation by Artificial Neural Networks. In: Günter, A., Kruse, R., Neumann, B. (eds) KI 2003: Advances in Artificial Intelligence. KI 2003. Lecture Notes in Computer Science(), vol 2821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39451-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-39451-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20059-8
Online ISBN: 978-3-540-39451-8
eBook Packages: Springer Book Archive