Improving the associative rule chaining architecture

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)


This paper describes improvements to the rule chaining architecture presented in [1]. The architecture uses distributed associative memories to allow the system to utilise memory eciently, and superimposed distributed representations in order to reduce the time complexity of a tree search to O(d), where d is the depth of the tree. This new work reduces the memory required by the architecture, and can also further reduce the time complexity.
Original languageEnglish
Title of host publicationArtificial Neural Networks and Machine Learning - ICANN 2013
Subtitle of host publication23rd International Conference on Artificial Neural Networks, Sofia, Bulgaria, September 2013. Proceedings.
EditorsV Mladenov, G Palm, B Appollini, P Koprinkova-Hristova, A Villa, N Kasabov
Place of PublicationBerlin
Number of pages8
Volume8131 LNCS
ISBN (Electronic)978-3-642-40728-4
ISBN (Print)978-3-642-40727-7
Publication statusPublished - 2013

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Cite this