Neural Networks for Processing Data Structures

Alessandro Sperduti

Abstract

The possibility to represent and to process structures in a neural network greatly increases the computational capability of neural networks. This new capability, besides to provide a new tool for the classification of structures, can also be exploited to integrate neural networks and symbolic systems in a hybrid system. In fact, structures generated by a symbolic module can be evaluated by this type of networks and their evaluation can be used to modify the behavior of the symbolic module. An instance of this integration scheme is given, for example, by learning heuristics for automated deduction systems. Goller reported very successful results in using a Back-propagation Through Structure network within the SETHEO theorem prover [8]. On the other side, it is not difficult to figure out, in analogy with finite state automata extraction from recurrent networks, how to extract tree automata from a neural network for structures. This would allow the above scheme to work on the other side around, with a neural module which is driven by a symbolic subsystem.
BibTeX
@inproceedings{sperduti1997neural,
  author = {Alessandro Sperduti},
  title = {{Neural Networks for Processing Data Structures}},
  booktitle = {Summer School on Neural Networks},
  year = {1997},
  doi = {10.1007/bfb0053997},
}

Loading related content...

Figure