In this paper, we prove that any finite time trajectory of a given n-dimensional dynamical system can be approximately realized by the internal state of the output units of a continuous time recurrent neural network with n output units, some hidden units, and an appropriate initial condition. The es
Approximating the Semantics of Logic Programs by Recurrent Neural Networks
✍ Scribed by Steffen Hölldobler; Yvonne Kalinke; Hans-Peter Störr
- Book ID
- 110263209
- Publisher
- Springer US
- Year
- 1999
- Tongue
- English
- Weight
- 132 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0924-669X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we prove that any continuous mapping can be approximately realized by Rumelhart-Hinton-Williams' multilayer neural networks with at least one hidden layer whose output functions are sigmoid functions. The starting point of the proof for the one hidden layer case is an integral formula
Neural networks and inductive logic programming (ILP) have been compared to linear regression for modelling the QSAR of the inhibition of E. coli dihydrofolate reductase (DHFR) by 2,4-diamino-5-(substituted benzyl)pyrimidines, and, in the subsequent paper [