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 Tp can be computed by the colimit of a family of neural networks determined by P. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
APA
Seda, A. K. (2007). Morphisms of ANN and the computation of least fixed points of semantic operators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4527 LNCS, pp. 224–233). Springer Verlag. https://doi.org/10.1007/978-3-540-73053-8_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free