Conditional transition networks and computational processes for use interactive computer-based systems

摘要

A conditional transition network for representing a domain of knowledge in a computer based system and computational procedures for use with the same is here presented. Each node of the network comprises a number of data fields, namely: a Precondition Field which contains an expression that evaluates to either TRUE, POSSIBLE or FALSE; a Question Field consisting of a linguistic string; an Answer Field whose expression can evaluate to any numerical or string domain, a Contents Field from a textual, visual, audio, or multimedia domain; and several other fields including a Delay Field. The edges of the network are induced by the precondition and answer formula and by edges embedded in the contents. If the precondition of node A refers to node B, then there is a precondition edge from B to A. Similarly, if the answer formula of node A refers to node B, then there is an answer edge from node B to node A. Edges from the Contents Field of one node to the Contents Field of another node are called hypermedia edges or links. They also may have predicates attached to them. When the querier of the network answers questions, various nodes change their precondition values among the values TRUE, POSSIBLE and FALSE. TRUE nodes correspond to those the querier should examine further. FALSE ones correspond to those of no further interest. POSSIBLE ones correspond to those that may or may not be of further interest.