A connectionist model for predicate logic reasoning using coarse-coded distributed representations

Authors:
Sriram G. Sanjeevi;Pushpak Bhattacharya
Affiliations:
Dept. of Comp. Science & Engg., N.I.T. Warangal, Warangal;Dept. of Comp. Science & Engg., I.I.T. Bombay, Mumbai
Venue:
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Year:
2005

Citing 5
Cited 3

Distributed representations

Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
Neural Networks: A Comprehensive Foundation

Neural Networks: A Comprehensive Foundation
Connectionist inference models

Neural Networks
Advances in SHRUTI—A Neurally Motivated Model of RelationalKnowledge Representation and Rapid Inference Using Temporal Synchrony

Applied Intelligence
Artificial Intelligence: A Modern Approach

Artificial Intelligence: A Modern Approach

A connectionist knowledge based system using coarse-coded distributed representations

Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Connectionist predicate logic model with parallel execution of rule chains

Proceedings of the International Conference and Workshop on Emerging Trends in Technology
A fault tolerant neuro-fuzzy inference system: using coarse-coded distributed representations

CIMMACS'05 Proceedings of the 4th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a model for reasoning using forward chaining for predicate logic rules and facts with coarse-coded distributed representations for instantiated predicates in a connectionist frame work. Distributed representations are known to give advantages of good generalization, error correction and graceful degradation of performance under noise conditions. The system supports usage of complex rules which involve multiple conjunctions and disjunctions. The system solves the variable binding problem in a new way using coarse-coded distributed representations of instantiated predicates without the need to decode them into localist representations. Its performance with regard to generalization on unseen inputs and its ability to exhibit fault tolerance under noise conditions is studied and has been found to give good results.