This paper describes KRL, a Knowledge Representation Language designed for use in understander systems. It outlines both the general concepts which underlie our research and the details of KRL‐0, an experimental implementation of some of these concepts. KRL is an attempt to integrate procedural knowledge with a broad base of declarative forms. These forms provide a variety of ways to express the logical structure of the knowledge, in order to give flexibility in associating procedures (for memory and reasoning) with specific (...) pieces of knowledge, and to control the relative accessibility of different facts and descriptions. The formalism for declarative knowledge is based on structured conceptual objects with associated descriptions. These objects form a network of memory units with several different sorts of linkages, each having well‐specified implications for the retrieval process. Procedures can be associated directly with the internal structure of a conceptual object. This procedurul attachment allows the steps for a particular operation to be determined by characteristics of the specific entities involved.The control structure of KRL is based on the belief that the next generation of intelligent programs will integrate data‐directed and goal‐directed processing by using multiprocessing. It provides for a priority‐ordered multiprocess agenda with explicit (user‐provided) strategies for scheduling and resource allocation. It provides procedure directories which operate along with process frameworks to allow procedural parameterization of the fundamental system processes for building, comparing, and retrieving memory structures. Future development of KRL will include integrating procedure definition with the descriptive formalism. (shrink)

Although the connectionist approach has lead to elegant solutions to a number of problems in cognitive science and artificial intelligence, its suitability for dealing with problems in knowledge representation and inference has often been questioned. This paper partly answers this criticism by demonstrating that effective solutions to certain problems in knowledge representation and limited inference can be found by adopting a connectionist approach. The paper presents a connectionist realization of semantic networks, that is, it describes how knowledge about concepts, their (...) properties, and the hierarchical relationship between them may be encoded as an interpreter‐free massively parallel network of simple processing elements that can solve an interesting class of inheritance and recognition problems extremely fast—in time proportional to the depth of the conceptual hierarchy. The connectionist realization is based on an evidential formulation that leads to principled solutions to the problems of exceptions and conflicting multiple inheritance situations during inheritance, and the best‐match or partial‐match computation during recognition. The paper also identifies constraints that must be satisfied by the conceptual structure in order to arrive at an efficient parallel realization. (shrink)

Much of the progress in the fields constituting cognitive science has been based upon the use of explicit information processing models, almost exclusively patterned after conventional serial computers. An extension of these ideas to massively parallel, connectionist models appears to offer a number of advantages. After a preliminary discussion, this paper introduces a general connectionist model and considers how it might be used in cognitive science. Among the issues addressed are: stability and noise‐sensitivity, distributed decision‐making, time and sequence problems, and (...) the representation of complex concepts. (shrink)

The system presented by the author in The Logical Foundations of Statistical Inference suffered from certain technical difficulties, and from a major practical difficulty; it was hard to be sure, in discussing examples and applications, when you had got hold of the right reference class. The present paper, concerned mainly with the characterization of randomness, resolves the technical difficulties and provides a well structured framework for the choice of a reference class. The definition of randomness that leads to this framework (...) is simplified and clarified in a number of respects. It resolves certain puzzles raised by S. Spielman and W. Harper in their contributions to Profiles: Henry E. Kyburg, Jr. and Isaac Levi 1982). (shrink)