Not enough data to create a plot.
Try a different view from the menu above.
Country
Models of learning systems
Buchanan, B. G. | Mitchell, T. M. | Smith, R. G. | Johnson, C. R.
"The terms adaptation, learning, concept-formation, induction, self-organization, and self-repair have all been used in the context of learning system (LS) research. The research has been conducted within many different scientific communities, however, and these terms have come to have a variety of meanings. It is therefore often difficult to recognize that problems which are described differently may in fact be identical. Learning system models as well are often tuned to the require- ments of a particular discipline and are not suitable for application in related disciplines."In Encyclopedia of Computer Science and Technology, Vol. 11. Dekker
The Inference of Regular LISP Programs from Examples
—A class of LISP programs that is analogous to the finite-state automata is defined, and an algorithm is given for constructing such programs from examples of their input-output behavior. It is shown that the algorithm has robust performance for a wide variety of inputs and that it converges to a solution on the basis of minimum input information.IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, VOL. SMC-8, NO. 8,
Dynamic probability, computer chess, and the measurement of knowledge
In E. W. Elcock and D. Michie (Eds.), Machine intelligence 8. New York: Wiley.
Consistency in networks of relations
"Artificial intelligence tasks which can be formulated as constraint satisfaction problems, with which this paper is for the most part concerned, are usually solved by backtracking. By examining the thrashing behavior that nearly always accompanies backtracking, identifying three of its causes and proposing remedies for them we are led to a class of algorithms which can profitably be used to eliminate local (node, arc and path) inconsistencies before any attempt is made to construct a complete solution. A more general paradigm for attacking these tasks is the alternation of constraint manipulation and case analysis producing an OR problem graph which may be searched in any of the usual ways.Many authors, particularly Montanan i and Waltz, have contributed to the development of these ideas; a secondary aim of this paper is to trace that history. The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the many applications, both realized and potential, of network consistency algorithms."See also: sciencedirect.comArtificial Intelligence 8:99-118
An experiment on inductive learning in chess end games.
In E. W. Elcock and D. Michie (Eds.), Machine intelligence 8. New York: Wiley.
Control requirements for the design of production system architectures
ACM symposium on artificial intelligence and programming languages, Rochester, N.Y., 37-44.
Inference and knowledge in language comprehension.
In E. W. Elcock and D. Michie (Eds.), Machine intelligence 8. New York: Wiley.
Representation and understanding of text
In E. W. Elcock and D. Michie (Eds.), Machine intelligence 8. New York: Wiley.
A Chess Combination Program Which Uses Plans
The program analyses carefully the initial situation. It creates some plans and tries to execute them. It analyses the situations deeper in the tree only if the plan fails. In that case it generates new plans correcting what is wrong in the old one. So, the program considers only natural branches of the tree. It can find combinations for which it is necessary to look more than twenty ply ahead. The paper describes the methods used for analyzing a situation and for modifying unsuccessful plans. Then we examine some results found by the program.Artificial Intelligence 8 (1977), 275-321