Morphisms of ANN and the Computation of Least Fixed Points of Semantic Operators

We consider a notion of morphism of neural networks and develop its properties. We show how, given any definite logic program P, the least fixed point of the immediate consequence operator TP can be computed by the colimit of a family of neural networks determined by P.

• Type: Conference
• Year: 2007
• Where: IWINAC
• Authors: Anthony Karel Seda
• Keywords: Consequence Operator Tp, Definite Logic Program, IWINAC 2007, Neural Networks