• DocumentCode
    3335403
  • Title

    Towards connectionist rule-based systems

  • Author

    Samad, Tariq

  • Author_Institution
    Honeywell CSDD, Golden Valley, MN, USA
  • fYear
    1988
  • fDate
    24-27 July 1988
  • Firstpage
    525
  • Abstract
    A connectionist architecture, called RUBICON, for implementing rule-based systems, is described. RUBICON uses both distributed and local representations. Input and output are fully distributed, allowing the use of microfeatures for robust interfacing to the external world. All input units, however, are local. The local internal representation results in straightforward network definition for a set of rules, and it should also facilitate adaptation. There are a number of features that distinguish RUBICON from previous connectionist attempts at developing rule-based systems. These include: an arbitrary number of antecedent and consequent expressions in any rule, the addition and deletion of working memory elements, chained inferencing, and the handling of negated expressions in antecedent and consequent clauses. A toy expert system for film identification is used as an illustration.<>
  • Keywords
    computer architecture; knowledge based systems; neural nets; RUBICON; antecedent expressions; chained inferencing; clauses; connectionist rule-based systems; consequent expressions; distributed representations; expert system; film identification; local representations; microfeatures; negated expressions; neural nets; robust interfacing; working memory elements; Computer architecture; Knowledge based systems; Neural networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1988., IEEE International Conference on
  • Conference_Location
    San Diego, CA, USA
  • Type

    conf

  • DOI
    10.1109/ICNN.1988.23968
  • Filename
    23968