Inheritance reasoning in connectionist networks

Abstract

Summary form only given, as follows. A bidirectional network model is described for inheritance reasoning which processes queries by combinations of top-down and bottom-up reasoning. The model, which is based on theoretical work in nonmonotonic reasoning, permits multiple inheritance paths in acyclic inheritance theories and allows an arbitrary preference relation among the inferences in the theory (to handle exceptions, for example). Unlike other inheritance models which compute extensions serially (maximally consistent models), the network gains substantially more parallelism by simultaneously reasoning in multiple extensions when possible.<>