Technology
Game-playing and game-learning automata
In Fox, L. (Ed.), Advances in Programming and Non-Numerical Computation, pp. 183â200. Pergamon.
Statistical inference for probabilistic functions of finite state Markov chains
Annals of Mathematical Statistics, 41.
Cognitive processes in solving algebra word problems
In B. Kleinmuntz (Ed.), Problem solving. New York: Wiley, 51-119.
An approach toward answering English questions from text
Simmons, R. F. | Burger, J. F. | Long, R. E.
Research on question answering by Raphael, Black, and Elliott, and our own work on Protosynthex II has shown that question-answering algorithms can be most easily written if the text source is in the form of simple, explicitly structured sets of subject-verb-nominal strings. Question-answering algorithms that have thus far been developed include word- and structure-matching operations and some few logical inference functions. All of the systems cited have in some fashion limited their input language to simple subject-verb-nominal strings, thus eliminating many problems of syntactic analysis and providing a normalized form for language data.
Experiments with the graph traverser program
An automatic method is described for the solution of a certain family of problems. To belong to this family a problem must be expressible in the language of graph theory as that of finding a path between two specified nodes of a specified graph. The method depends upon the evaluation of intermediate states of the problem according to the extent to which they have features in common with the goal state. We define evaluation functions each of which assigns to any state of the problem a value which is in some way related to its'distance' from the goal state. Equivalently we assign to nodes of the corresponding graph values which are related to the distance over the graph from the goal node.
Storage and retrieval of aspects of meaning in directed graph structures
An experimental system that uses LISP to make a conceptual dictionary is described. The dictionary associates with each English word the syntactic information, definitional material, and references to the contexts in which it has been used to define other words. Such relations as class inclusion, possession, and active or passive actions are used as definitional material. The resulting structure serves as a powerful vehicle for research on the logic of question answering. Examples of methods of inputting information and answering simple English questions are given.
Optimal control of Markov decision processes with incomplete state estimation
J. Math. Anal. Applic., 10, 174–205.
Optimal control of partially observable Markov systems
This paper discusses the discrete-time Bayesian optimal control of stochastic dynamic systems where some vectors, which augment the system state vectors and the observed state vectors by additional variables, constitute multi-dimensional Markov chains. Optimal control of such Markovian control systems is considered under the assumption that only a part of the components of such vectors is observed by the control system. Certain conditional probability densities needed in deriving optimal control policies are derived, and computational procedures which determine optimal control sequences are given.