One approach to integrating first-order logic programming and neural network systems employs the approximation of semantic operators by feedforward networks. For this purpose, it is necessary to view these semantic operators as continuous functions on the reals. This can be accomplished by endowing the space of all interpretations of a logic program with topologies obtained from suitable embeddings. We will present such topologies which arise naturally out of the theory of logic programming, discuss continuity issues of several well-known semantic operators, and derive some results concerning the approximation of these operators by feedforward neural networks.
& Seda, A. K.
(2003). Continuity of Semantic Operators in Logic Programming and Their Approximation by Artificial Neural Networks. Lecture Notes in Computer Science, 2821, 355-369.