| P. Smolensky, G. Legendre, and Y. Miyata. Integrating Connectionist and Symbolic Computation for the Theory of Language. In V. Honavar and L. Uhr, editors, Artificial Intelligence and Neural Networks: Steps toward Principled Integration, pages 509--530. Academic Press, 1994. |
....languages (expressed as Horn clause language) with neural networks (expressed as constraints) The importance of a clear and sound integration between the two paradigms is obvious. The integration of these paradigms can succeed in solving complex problems that require heterogeneous knowledge bases [19]. There are two importantpoints in this plan. The former is to use the well known paradigm of constraint logic programming and the already developed results [8] The latter is that neural networks can be trained and tested as a stand alone component and then plugged into a rule system and ....
P. Smolensky, G. Legendre, and Y. Miyata. Integrating Connectionist and Symbolic Computation for the Theory of Language. In V. Honavar and L. Uhr, editors, Artificial Intelligence and Neural Networks: Steps toward Principled Integration, pages 509--530. Academic Press, 1994.
No context found.
Smolensky, P., Legendre, G., and Miyata, Y. (1994). Integrating Connectionist and Symbolic Computation for the Theory of Language. In: Artificial Intelligence and Neural Networks: Steps Toward Principled Integration. Honavar, V. and Uhr, L. (Ed.) San Diego, CA: Academic Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC