dc.contributor.author | St Aubyn, M. | |
dc.date.accessioned | 2010-11-15T15:37:27Z | |
dc.date.available | 2010-11-15T15:37:27Z | |
dc.date.issued | 1995 | |
dc.identifier.citation | St Aubyn , M 1995 , The representation of rules in connectionist models . UH Computer Science Technical Report , vol. 227 , University of Hertfordshire . | |
dc.identifier.other | PURE: 99762 | |
dc.identifier.other | PURE UUID: 0400a5c9-9d75-4aa6-a8f5-b8f8785a9e11 | |
dc.identifier.other | dspace: 2299/4992 | |
dc.identifier.uri | http://hdl.handle.net/2299/4992 | |
dc.description.abstract | Three 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.iso | eng | |
dc.publisher | University of Hertfordshire | |
dc.relation.ispartofseries | UH Computer Science Technical Report | |
dc.title | The representation of rules in connectionist models | en |
dc.contributor.institution | School of Computer Science | |
rioxxterms.type | Other | |
herts.preservation.rarelyaccessed | true | |