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

  • Authors:

  • Anthony Karel Seda

  • Affiliations:

  • Department of Mathematics and Boole Centre for Research in Informatics, University College Cork, Cork, Ireland

  • Venue:
  • IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 TPcan be computed by the colimit of a family of neural networks determined by P.