Information Technology
The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
Artificial Intelligence 8:137-153.
What's in a concept: Structural foundations for semantic networks
Int. Journal of Man-Machine Studies 9(2):127-152
Viewing control structures as patterns of passing messages
Artificial Intelligence 8(3):323-364. See also: Comments on C. Hewitt, viewing control structures as patterns of passing messages, Artificial Intelligence 8 (1977) 323-364 (http://dl.acm.org/citation.cfm?id=1643292).
Segmentation of static scenes
Computer Graphics and Image Processing 6:221-276
Decision theory and artificial intelligence II: The hungry monkey
Technical report, Computer Science Department, University of Rochester.
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
