𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Approximation of dynamical systems by co
✍ Ken-ichi Funahashi; Yuichi Nakamura 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 431 KB

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

On the approximate realization of contin
✍ Ken-Ichi Funahashi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 733 KB

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

Quantitative structure-activity relation
✍ Jonathan D. Hirst; Ross D. King; Michael J. E. Sternberg 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 914 KB

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 [