Show simple item record

dc.contributor.authorSt Aubyn, M.
dc.date.accessioned2010-11-15T15:37:27Z
dc.date.available2010-11-15T15:37:27Z
dc.date.issued1995
dc.identifier.citationSt Aubyn , M 1995 , The representation of rules in connectionist models . UH Computer Science Technical Report , vol. 227 , University of Hertfordshire .
dc.identifier.otherPURE: 99762
dc.identifier.otherPURE UUID: 0400a5c9-9d75-4aa6-a8f5-b8f8785a9e11
dc.identifier.otherdspace: 2299/4992
dc.identifier.urihttp://hdl.handle.net/2299/4992
dc.description.abstractThree models of connectionist rule processing are presented and discussed: Shastri and Ajjanagadde's SHRUTI system, which uses connectionist mechanisms to overcome the inefficiency of classical rule-based models; Sun's CONSYDERR model, which combines rule-processing and similarity-matching in a two-level architecture; and Sumida and Dyer's Parallel Distributed Semantic (PDS) Network, which adds generalisation and inferencing capabilities to a semantic network. The Sun and Sumida and Dyer models are illustrated with implementations and example runs. Aspects of rule-based reasoning not addressed by these models (rule learning, the encoding of rules wuthout hard-wired structure, and holistic rule application) are discussed in the context of a proposed new model.en
dc.language.isoeng
dc.publisherUniversity of Hertfordshire
dc.relation.ispartofseriesUH Computer Science Technical Report
dc.rightsOpen
dc.titleThe representation of rules in connectionist modelsen
dc.contributor.institutionSchool of Computer Science
dc.relation.schoolSchool of Computer Science
dcterms.dateAccepted1995
rioxxterms.typeOther
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeOpen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record