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

@inproceedings{Seda2007MorphismsOA,
title={Morphisms of ANN and the Computation of Least Fixed Points of Semantic Operators},
author={Anthony Karel Seda},
booktitle={IWINAC},
year={2007}
}