On the Integration of Connectionist and Logic-Based Systems

Electronic Notes in Theoretical Computer Science

Volumn 161, Issue 1, 2006, Pages 109-130

  Seda, Anthony Karel ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

approximation; Logic programs; metrics; neural networks; pointwise convergence; uniform convergence

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTER PROGRAMMING; INTEGRATION; NEURAL NETWORKS; PROBLEM SOLVING; SECURITY SYSTEMS; SEMANTICS;

LOGIC PROGRAMS; METRICS; POINTWISE CONVERGENCE; SINGLE INTEGRATED SYSTEM; UNIFORM CONVERGENCE;

LOGIC PROGRAMMING;

EID: 33747889881     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.04.028     Document Type: Article

References (31)

1. Bader, S., A.S. d'Avila Garcez and P. Hitzler, Computing first-order logic programs by fibring artificial neural networks, in: Proceedings of the 18th International FLAIRS Conference, Florida, May 2005, 2005, to appear
2. Bader S., and Hitzler P. Logic programs, iterated function systems, and recurrent radial basis function networks. Journal of Applied Logic 2 (2004) 273-300
3. Bornscheuer S.-E., Hölldobler S., Kalinke Y., and Strohmaier A. Massively parallel reasoning. Automated Deduction - A Basis for Applications, Vol. II (1998), Kluwer Academic Publishers 291-321
4. Cavedon L. Acyclic programs and the completeness of SLDNF-resolution. Theoretical Computer Science 86 (1991) 81-92
5. Cybenko G. Approximation by superpositions of a sigmoidal function. Mathematics of Control, Signals, and Systems 2 (1989) 303-314
6. Fitting M. Metric methods: Three examples and a theorem. The Journal of Logic Programming 21 (1994) 113-127
7. Fitting M. Fixpoint semantics for logic programming - A survey. Theoretical Computer Science 278 (2002) 25-51
8. Franklin S.P., and Garzon M. Neural computability. In: Omidvar O. (Ed). Progress in Neural Networks, Vol. 1 (1990) 128-144
9. Fu L. Neural Networks in Computer Intelligence (1994), McGraw-Hill, Inc.
10. Funahashi K.-I. On the approximate realization of continuous mappings by neural networks. Neural Networks 2 (1989) 183-192
11. Garzon M., and Botelho F. Dynamical approximation by recurrent neural networks. Neurocomputing 29 (1999) 25-46
12. Gelfond, M. and V. Lifschitz, The stable model semantics for logic programming, in: R.A. Kowalski and K.A. Bowen, editors, Logic Programming. Proceedings of the 5th International Conference and Symposium on Logic Programming (1988), pp. 1070-1080
13. Hanus, M., On extra variables in (equational) logic programming, in: Proceedings of the Twelfth International Conference on Logic Programming, Tokyo, June, 1995 (1995), pp. 665-679
14. Healy, M.J. and T.P. Caudell, Neural networks, knowledge, and cognition: A mathematical semantic model based upon category theory, Technical Report UNM: EECE-TR-04-020, School of Engineering, New Mexico (2004)
15. Hitzler, P., Corollaries on the fixed-point completion: studying the stable semantics by means of the Clark completion, in: D. Seipel, M. Hanus, U. Geske and O. Bartenstein, editors, Proceedings of the 15th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2004, and the 18th Workshop on Logic Programming, WLP 2004, Potsdam, Germany, March, 2004, pp. 13-27
16. Hitzler P., Hölldobler S., and Seda A.K. Logic programs and connectionist networks. Journal of Applied Logic 2 (2004) 245-272
17. Hitzler, P. and A.K. Seda, Characterizations of classes of programs by three-valued operators, in: M. Gelfond, N. Leone and G. Pfeifer, editors, 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, Lecture Notes in Artificial Intelligence 1730 (1999), pp. 357-371
18. Hölldobler, S., Challenge problems for the integration of logic and connectionist systems, in: F. Bry, U. Geske and D. Seipel, editors, Proceedings 14. Workshop Logische Programmierung, GMD Report 90, GMD, 2000, pp. 161-171
19. Hölldobler, S. and Y. Kalinke, Towards a new massively parallel computational model for logic programming, in: Proceedings ECAI94 Workshop on Combining Symbolic and Connectionist Processing (1994), pp. 68-77
20. Hölldobler S., Kalinke Y., and Störr H.-P. Approximating the semantics of logic programs by recurrent neural networks. Applied Intelligence 11 (1999) 45-58
21. Hornik K., Stinchcombe M., and White H. Multilayer feedforward networks are universal approximators. Neural Networks 2 (1989) 359-366
22. Lloyd J.W. Foundations of Logic Programming (1987), Springer, Berlin
23. Maher M.J. Equivalences of logic programs. In: Minker J. (Ed). Foundations of Deductive Databases and Logic Programming (1988), Morgan Kaufmann, Los Altos, CA 627-658
24. Moore C. Generalized shifts: Uunpredictability and undecidability in dynamical systems. Nonlinearity 4 (1991) 199-230
25. Seda A.K. Topology and the semantics of logic programs. Fundamenta Informaticae 24 (1995) 359-386
26. Seda A.K. Quasi-metrics and the semantics of logic programs. Fundamenta Informaticae 29 (1997) 97-117
27. Seda, A.K. and M. Lane, On approximation in the integration of connectionist and logic-based systems, in: L. Li and K. Yen, editors, Proceedings of The Third International Conference on Information, Information'04, Tokyo, November, 2004 (2004), pp. 297-300
28. Seda, A.K. and M. Lane, On the measurability of the semantic operators determined by logic programs, Information 8 (2005), pp. 1-19, to appear
29. Siegelmann H.T., and Sontag E.D. On the computational power of neural nets. Journal of Computer and System Sciences 50 (1995) 132-150
30. Wendt M. Unfolding the well-founded semantics. Journal of Electrical Engineering, Slovak Academy of Sciences 53 (2002) 56-59
31. White H. Artificial Neural Networks: Approximation and Learning Theory (1992), Basil Blackwell, Oxford