Morphisms of ANN and the computation of least fixed points of semantic operators

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4527 LNCS, Issue PART 1, 2007, Pages 224-233

  Seda, Anthony Karel ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LOGIC PROGRAMMING; SEMANTICS;

LEAST FIXED POINT; SEMANTIC OPERATORS;

NEURAL NETWORKS;

EID: 38149005555     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73053-8_22     Document Type: Conference Paper

References (6)

1. Healy, M.J., Caudell, T.P.: 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).
2. Hitzler, P., Hölldobler, S., Seda, A.K.: Logic programs and connectionist networks. Journal of Applied Logic 2(3) (2004) 245-272.
3. Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1987).
4. MacLane, S.: Categories for the Working Mathematician. Volume 5 of Graduate Texts in Mathematics. Springer-Verlag (1971).
5. Pfalzgraf, J.: Modelling connectionist networks: Categorical, geometric aspects (Towards "Homomorphic Learning" ). In: Proceedings of Computing Anticipatory Systems: CASYS 2003, Liège, Belgium, August 11-16, 2003. 1-15.
6. Seda, A.K.: On the integration of connectionist and logic-based systems. In Hurley, T., Mac an Airchinnigh, M.M., Schellekens, M., Seda, A.K., Strong, G., eds.: Proceedings of MFCSIT'04, Trinity College Dublin, July, 2004. Volume 161 of Electronic Notes in Theoretical Computer Science (ENTCS)., Elsevier (2006) 109-130.