Logic programs and connectionist networks

Journal of Applied Logic

Volumn 2, Issue 3, 2004, Pages 245-272

  Hitzler, Pascal ^a   Hölldobler, Steffen ^a   Seda, Anthony Karel ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

Connectionist networks; Logic programming; Metric spaces

Indexed keywords

APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; FEEDFORWARD NEURAL NETWORKS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; SEMANTICS; THEOREM PROVING;

CONNECTIONIST NETWORKS; CONTRACTION MAPPINGS; FEEDFORWARD CONNECTIONIST NETWORK; FUNAHASHI THEOREM; METRIC SPACES;

LOGIC PROGRAMMING;

EID: 10944269335     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2004.03.002     Document Type: Article

References (54)

1. Andrews R. Diederich J. Tickle A.B. A survey and critique of techniques for extracting rules from trained artificial neural networks Knowledge-Based Systems 8 6 1995 373 389
2. Abramsky S. Jung A. Domain theory Abramsky S. Gabbay D. Maibaum T.S.E. Handbook of Logic in Computer Science, vol. 3 1994 Clarendon Oxford
3. Apt K.R. Pedreschi D. Reasoning about termination of pure Prolog programs Inform. and Comput. 106 1993 109 157
4. Bartle R.G. The Elements of Integration 1966 Wiley New York
5. Bezem M. Characterizing termination of logic programs with level mappings Lusk E.L. Overbeek R.A. Proceedings of the North American Conference on Logic Programming 1989 69 80 MIT Press Cambridge, MA
6. S. Bader, P. Hitzler, Logic programs, iterated function systems, and recurrent radial basis function networks, in this issue
7. Batarekh A. Subrahmanian V.S. Topological model set deformations in logic programming Fund. Inform. 12 1989 357 400
8. Cavedon L. Acyclic programs and the completeness of SLDNF-resolution Theoret. Comput. Sci. 86 1991 81 92
9. Clark K.L. Negation as failure Gallaire H. Minker J. Logic and Data Bases 1978 293 322 Plenum Press New York
10. Dowling W.F. Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional Horn formulae J. Logic Programming 1 3 1984 267 284
11. d'Avila Garcez A.S. Broda K. Gabbay D.M. Symbolic knowledge extraction from trained neural networks: A sound approach Artificial Intelligence 125 2001 155 207
12. d'Avila Garcez A.S. Broda K.B. Gabbay D.M. Neural-Symbolic Learning Systems-Foundations and Applications Perspectives in Neural Computing 2002 Springer Berlin
13. d'Avila Garcez A.S. Lamb L.C. Gabbay D.M. A connectionist inductive learning system for modal logic programming Proceedings of the IEEE International Conference on Neural Information Processing ICONIP'02, Singapore 2002
14. d'Avila Garcez A.S. Zaverucha G. The connectionist inductive learning and logic programming system Appl. Intelligence (Special Issue on Neural Networks and Structured Knowledge) 11 1 1999 59 77
15. d'Avila Garcez A.S. Zaverucha G. de Carvalho L.A.V. Logical inference and inductive learning in artificial neural networks Hermann C. Reine F. Strohmaier A. Knowledge Representation in Neural Networks 1997 33 46 Logos Verlag Berlin
16. Denecker M. Wiktor Marek V. Truszczynski M. Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning Minker J. Logic-based Artificial Intelligence 2000 127 144 Kluwer Academic Boston
17. Fitting M. A Kripke-Kleene semantics for general logic programs J. Logic Programming 2 1985 295 312
18. Fitting M. Metric methods: Three examples and a theorem J. Logic Programming 21 3 1994 113 127
19. Fitting M. Fixpoint semantics for logic programming-A survey Theoret. Comput. Sci. 278 1-2 2002 25 51
20. Fodor J.A. Pylyshyn Z.W. Connectionism and cognitive architecture: A critical analysis Pinker S. Mehler J. Connections and Symbols 1988 3 71 MIT Press Cambridge, MA
21. Funahashi K.-I. On the approximate realization of continuous mappings by neural networks Neural Networks 2 1989 183 192
22. Gelfond M. Lifschitz V. The stable model semantics for logic programming Kowalski R.A. Bowen K.A. Logic Programming. Proceedings of the 5th International Conference and Symposium on Logic Programming 1988 1070 1080 MIT Press Cambridge, MA
23. P. Hitzler, Generalized metrics and topology in logic programming semantics, PhD Thesis, Department of Mathematics, National University of Ireland, University College Cork, 2001
24. Hölldobler S. Kalinke Y. Towards a massively parallel computational model for logic programming Proceedings ECAI94 Workshop on Combining Symbolic and Connectionist Processing 1994 68 77 ECCAI
25. Hertz J. Krogh A. Palmer R.G. Introduction to the Theory of Neural Computation 1991 Addison-Wesley Reading, MA
26. Hölldobler S. Kalinke Y. Störr H.-P. Approximating the semantics of logic programs by recurrent neural networks Appl. Intelligence 11 1999 45 58
27. Hölldobler S. Kalinke Y. Wunderlich J. A recursive neural network for reflexive reasoning Wermter S. Sun R. Hybrid Neural Symbolic Integration Lecture Notes in Artificial Intelligence vol. 1778 2000 46 62 Springer Berlin
28. S. Hölldobler, Automated inferencing and connectionist models, Technical Report AIDA-93-06, Intellektik, Informatik, TH Darmstadt, 1993 (Postdoctoral Thesis)
29. Hitzler P. Seda A.K. Characterizations of classes of programs by three-valued operators Gelfond M. Leone N. Pfeifer G. Logic Programming and Non-Monotonic Reasoning, Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'99, El Paso, TX Lecture Notes in Artificial Intelligence vol. 1730 1999 357 371 Springer Berlin
30. Hitzler P. Seda A.K. A note on relationships between logic programs and neural networks Gibson P. Sinclair D. Proceedings of the Fourth Irish Workshop on Formal Methods, IWFM'00, Electronic Workshops in Computing (eWiC) 2000 British Computer Society
31. Hitzler P. Seda A.K. A "converse" of the Banach contraction mapping theorem J. Electrical Engrg. 52 10/s 2001 3 6 Proceedings of the 3rd Slovakian Student Conference in Applied Mathematics, SCAM2001, Bratislava, Slovak Academy of Sciences
32. Hitzler P. Seda A.K. Semantic operators and fixed-point theory in logic programming Proceedings of the Joint IIIS & 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, FL 2001 International Institute of Informatics and Systemics: IIIS
33. Hitzler P. Seda A.K. Continuity of semantic operators in logic programming and their approximation by artificial neural networks Günter A. Krause R. Neumann B. Proceedings of the 26th German Conference on Artificial Intelligence, KI2003 Lecture Notes in Artificial Intelligence vol. 2821 2003 105 119 Springer Berlin
34. Hitzler P. Seda A.K. Generalized metrics and uniquely determined logic programs Theoret. Comput. Sci. 305 1-3 2003 187 219
35. Hornik K. Stinchcombe M. White H. Multilayer feedforward networks are universal approximators Neural Networks 2 1989 359 366
36. Jones N.D. Laaser W.T. Complete problems for deterministic sequential time Theoret. Comput. Sci. 3 1977 105 117
37. Karp R.M. Ramachandran V. Parallel algorithms for shared-memory machines van Leeuwen J. Handbook of Theoretical Computer Science 1990 869 941 Elsevier Science New York
38. Lloyd J.W. Foundations of Logic Programming 1988 Springer Berlin
39. McCarthy J. Epistomological challenges for connectionism Behavioral and Brain Sciences 11 1988 44 (Commentary on [50])
40. Y. McIntyre, Modellgenerierung mit konnektionistischen Systemen, PhD Thesis, TU Dresden, Fakultät Informatik, 2000
41. Minsky M.L. Papert S. Perceptrons 1972 MIT Press Cambridge, MA
42. Newell A. Physical symbol systems Cognitive Sci. 4 1980 135 183
43. Plate T.A. Holographic reduced representations Proceedings of the International Joint Conference on Artificial Intelligence 1991 30 35
44. Pollack J.B. Recursive auto-associative memory: Devising compositional distributed representations Proceedings of the 10th Annual Conference of the Cognitive Science Society 1988 33 39
45. Rumelhart D.E. Hinton G.E. Williams R.J. Learning internal representations by error propagation Parallel Distributed Processing 1986 MIT Press Cambridge, MA
46. Rosenblatt F. Principles of Neurodynamics: Perceptrons and the Theory of Brain Machines 1962 Spartan Books Washington
47. Shastri L. Ajjanagadde V. From associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony Behavioral and Brain Sciences 16 3 1993 417 494
48. Scutellà M.G. A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability J. Logic Programming 8 1990 265 273
49. Seda A.K. Topology and the semantics of logic programs Fund. Inform. 24 4 1995 359 386
50. Smolensky P. On the proper treatment of connectionism Behavioral and Brain Sciences 11 1988 1 74
51. Towell G.G. Shavlik J.W. Knowledge-based artificial neural networks Artificial Intelligence 70 1-2 1994 119 165
52. van Gelder A. Ross K.A. Schlipf J.S. The well-founded semantics for general logic programs J. ACM 38 3 1991 620 650
53. Wendt M. Unfolding the well-founded semantics J. Electrical Engineering, Slovak Academy of Sciences 53 12/s 2002 56 59 Proceedings of the 4th Slovakian Student Conference in Applied Mathematics, Bratislava, April 2002
54. Willard S. General Topology 1970 Addison-Wesley Reading, MA