Continuity of semantic operators in logic programming and their approximation by artificial neural networks

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2821, Issue , 2003, Pages 355-369

  Hitzler, Pascal ^a   Seda, Anthony K ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FEEDFORWARD NEURAL NETWORKS; LOGIC PROGRAMMING; MATHEMATICAL OPERATORS; THEOREM PROVING; TOPOLOGY; ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; NEURAL NETWORKS; SEMANTICS;

FUNAHASHI'S THEOREM; NEURO-SYMBOLIC INTEGRATION; SEMANTIC OPERATORS; CONTINUITY ISSUES; CONTINUOUS FUNCTIONS; EMBEDDINGS; FEED-FORWARD NETWORK; FIRST ORDER LOGIC; LOGIC PROGRAMS; NEURAL NETWORK SYSTEMS;

SEMANTICS; LOGIC PROGRAMMING;

EID: 9444277757     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39451-8_26     Document Type: Conference Paper

References (26)

1. Browne, A., Sun, R.: Connectionist inference models. Neural Networks 14 (2001) 1331-1355
2. 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. Volume 90 of GMD Report., GMD (2000) 161-171
3. Hölldobler, S., Störr, H.P., Kalinke, Y.: Approximating the semantics of logic programs by recurrent neural networks. Applied Intelligence 11 (1999) 45-58
4. Funahashi, K.I.: On the approximate realization of continuous mappings by neural networks. Neural Networks 2 (1989) 183-192
5. 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. Springer, Berlin (1999) 231-255
6. Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1988)
7. Willard, S.: General Topology. Addison-Wesley, Reading, MA (1970)
8. Batarekh, A., Subrahmanian, V.: Topological model set deformations in logic programming. Fundamenta Informaticae 12 (1989) 357-400
9. Seda, A.K.: Topology and the semantics of logic programs. Fundamenta Informaticae 24 (1995) 359-386
10. Abramsky, S., Jung, A.: Domain theory. In Abramsky, S., Gabbay, D., Maibaum, T.S., eds.: Handbook of Logic in Computer Science. Volume 3. Clarendon, Oxford (1994)
11. Hitzler, P.: Generalized Metrics and Topology in Logic Programming Semantics. PhD thesis, Department of Mathematics, National University of Ireland, University College Cork (2001)
12. Hitzler, P., Seda, A.K.: Generalized metrics and uniquely determined logic programs. Theoretical Computer Science (200x) to appear
13. Fitting, M.: Fixpoint semantics for logic programming - A survey. Theoretical Computer Science 278 (2002) 25-51
14. Hitzler, P., Seda, A.K.: Semantic operators and fixed-point theory in logic programming. In: Proceedings of the joint HIS & IEEE meeting of the 5th World Multiconference on Systemics, Cybernetics and Informatics, SCI2001 and the 7th International Conference on Information Systems Analysis and Synthesis, ISAS2001, Orlando, Florida, USA, International Institute of Informatics and Systemics: IIIS (2001)
15. Bartle, R.G.: The Elements of Integration. John Wiley & Sons, New York (1966)
16. 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'00. Electronic Workshops in Comupting (eWiC), British Computer Society (2000)
17. 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. Kluwer Academic Publishers, Boston (2000) 127-144
18. Fitting, M.: A Kripke-Kleene-semantics for general logic programs. The Journal of Logic Programming 2 (1985) 295-312
19. Hitzler, P., Seda, A.K.: Characterizations of classes of programs by three-valued operators. In Gelfond, M., Leone, N., Pfeifer, G., eds.: Logic Programming and Non-monotonic Reasoning, Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'99, El Paso, Texas, USA. Volume 1730 of Lecture Notes in Artificial Intelligence., Springer, Berlin (1999) 357-371
20. 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, MIT Press (1988) 1070-1080
21. Wendt, M.: Unfolding the well-founded semantics. Journal of Electrical Engineering, Slovak Academy of Sciences 53 (2002) 56-59 (Proceedings of the 4th Slovakian Student Conference in Applied Mathematics, Bratislava, April 2002).
22. Bishop, C.M.: Neural Networks for Pattern Recognition. Oxford University Press (1995)
23. Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Networks 2 (1989) 359-366
24. Cavedon, L.: Acyclic programs and the completeness of SLDNF-resolution. Theoretical Computer Science 88 (1991) 81-92
25. Fitting, M.: Metric methods: Three examples and a theorem. The Journal of Logic Programming 21 (1994) 113-127
26. Bader, S.: From logic programs to iterated function systems. Master's thesis, Department of Computer Science, Dresden University of Technology (2003)