In this book, we have seen that the integration of Connectionist Logic Systems (CLS) and Hybrid Systems by Translation (HST) may provide effective Neural-Symbolic Learning Systems. C-IL2P is an example of such a system. In order to enable effective learning from examples and background knowledge, the main insight was to keep the network structure as simple as possible, and try to find the best symbolic representation for it. We have done so by presenting a Translation Algorithm from logic programs to single hidden layer neural networks. It was essential, though, to show the equivalence between the symbolic representation and the neural network, in order to ensure a sound translation of the background knowledge into a connectionist representation. Such a theorem also rendered C-IL2P as a massively parallel model of symbolic computation, as in CLSs, with two corollaries showing that the neural network computes, respectively, the stable model semantics of the general logic program given as background knowledge, and the answer set semantics of the extended logic program given as background knowledge. An extension of the system to accommodate superiority relations between rules, finally provided the symbolic representation that best fits into single hidden layer networks; that of prioritised extended logic programming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this chapter
Cite this chapter
d’Avila Garcez, A.S., Broda, K.B., Gabbay, D.M. (2002). Neural-Symbolic Integration: The Road Ahead. In: Neural-Symbolic Learning Systems. Perspectives in Neural Computing. Springer, London. https://doi.org/10.1007/978-1-4471-0211-3_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0211-3_9
Publisher Name: Springer, London
Print ISBN: 978-1-85233-512-0
Online ISBN: 978-1-4471-0211-3
eBook Packages: Springer Book Archive