A connectionist model for commonsense reasoning incorporating rules and similarities

Abstract

For the purpose of modelling commonsense reasoning, we investigate connectionist models of rule-based reasoning, and show that while such models can usually carry out reasoning in exactly the same way as symbolic systems, they have more to offer in terms of commonsense reasoning. A connectionist architecture, CONSYDERR, is proposed for capturing certain commonsense reasoning competence, which partially remedies the brittleness problem in traditional rule-based systems. The architecture employs a two-level, dual representational scheme, which utilizes both localist and distributed representations and explores the synergy resulting from the interaction between the two. CONSYDERR is therefore capable of accounting for many difficult patterns in commonsense reasoning with this simple combination of the two levels. This work shows that connectionist models of reasoning are not just “implementations” of their symbolic counterparts, but better computational models of commonsense reasoning.