Symbolic Deductive Reasoning using Connectionist Models
In this paper, we try to combine the possibility of symbolic deductive reasoning with the learning capability of the connectionist models. We introduce several algorithms for learning relations between concepts and finding paths in a transitive manner between learned concepts. An application that im...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2004-06-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v12-n1/v12-n1-(pp127-145).pdf |
| _version_ | 1817996372503166976 |
|---|---|
| author | Mihai Horia Zaharia Florin Leon Dan Galea |
| author_facet | Mihai Horia Zaharia Florin Leon Dan Galea |
| author_sort | Mihai Horia Zaharia |
| collection | DOAJ |
| description | In this paper, we try to combine the possibility of symbolic deductive reasoning with the learning capability of the connectionist models. We introduce several algorithms for learning relations between concepts and finding paths in a transitive manner between learned concepts. An application that implements the proposed model is described and a number of case studies are presented. |
| first_indexed | 2024-04-14T02:21:22Z |
| format | Article |
| id | doaj.art-bc094510c77f4aca965e9783c4583f1c |
| institution | Directory Open Access Journal |
| issn | 1561-4042 |
| language | English |
| last_indexed | 2024-04-14T02:21:22Z |
| publishDate | 2004-06-01 |
| publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
| record_format | Article |
| series | Computer Science Journal of Moldova |
| spelling | doaj.art-bc094510c77f4aca965e9783c4583f1c2022-12-22T02:18:01ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422004-06-01121(34)127145Symbolic Deductive Reasoning using Connectionist ModelsMihai Horia Zaharia0Florin Leon1Dan Galea2Department of Automatic Control and Computer Engineering Technical University "Gh. Asachi", IasiDepartment of Automatic Control and Computer Engineering Technical University "Gh. Asachi", IasiDepartment of Automatic Control and Computer Engineering Technical University "Gh. Asachi", IasiIn this paper, we try to combine the possibility of symbolic deductive reasoning with the learning capability of the connectionist models. We introduce several algorithms for learning relations between concepts and finding paths in a transitive manner between learned concepts. An application that implements the proposed model is described and a number of case studies are presented.http://www.math.md/files/csjm/v12-n1/v12-n1-(pp127-145).pdfArtificial intelligencecognitive agentsschemataknowledge representationdeductive reasoningneural networks |
| spellingShingle | Mihai Horia Zaharia Florin Leon Dan Galea Symbolic Deductive Reasoning using Connectionist Models Computer Science Journal of Moldova Artificial intelligence cognitive agents schemata knowledge representation deductive reasoning neural networks |
| title | Symbolic Deductive Reasoning using Connectionist Models |
| title_full | Symbolic Deductive Reasoning using Connectionist Models |
| title_fullStr | Symbolic Deductive Reasoning using Connectionist Models |
| title_full_unstemmed | Symbolic Deductive Reasoning using Connectionist Models |
| title_short | Symbolic Deductive Reasoning using Connectionist Models |
| title_sort | symbolic deductive reasoning using connectionist models |
| topic | Artificial intelligence cognitive agents schemata knowledge representation deductive reasoning neural networks |
| url | http://www.math.md/files/csjm/v12-n1/v12-n1-(pp127-145).pdf |
| work_keys_str_mv | AT mihaihoriazaharia symbolicdeductivereasoningusingconnectionistmodels AT florinleon symbolicdeductivereasoningusingconnectionistmodels AT dangalea symbolicdeductivereasoningusingconnectionistmodels |