01275nas a2200085 4500008004100000245009500041210006900136520094400205856004001149 2005 eng d00aIntegrating First Order Logic Programs and Connectionist Systems - A Constructive Approach0 aIntegrating First Order Logic Programs and Connectionist Systems3 aSignificant advances have recently been made concerning the integration of symbolic knowledge representation with artificial neural networks (also called connectionist systems). However, while the integration with propositional paradigms has resulted in applicable systems, the case of first-order knowledge representation has so far hardly proceeded beyond theoretical studies which prove the existence of connectionist systems for approximating first-order logic programs up to any chosen precision. Advances were hindered severely by the lack of concrete algorithms for obtaining the approximating networks which were known to exist: the corresponding proofs are not constructive in that they do not yield concrete methods for building the systems. In this paper, we will make the required advance and show how to obtain the structure and the parameters for different kinds of connectionist systems approximating covered logic programs. uhttp://knoesis.wright.edu/node/1808