Technology
Optimal problem-solving search: All-or-none solutions
"Optimal algorithms are derived for satisficing problem-solving search, that is, search where the goal is to reach any solution, no distinction being made among different solutions. This task is quite different from search for best solutions or shortest path solutions. Constraints may be placed on the order in which sites may be searched. This paper treats satisficing searches through partially ordered search spaces where there are multiple alternative goals." Artificial Intelligence 6:235-247.
Some methods of controlling the tree search in chess programs
Adelson-Velsky, G. M. | Arlazarov, V. L. | Donskoy, M. V.
Artificial Intelligence 6:361-371
A preferential, pattern-seeking semantics for natural language inference
Artificial Intelligence 6:53-74.
Preference semantics
In E. L. Keenan (Ed.), Formal semantics of natural language. Cambridge, England: Cambridge University Press, 329-348.
Frame representations and the procedural/declarative controversy
In D. G. Bobrow and A. Collins (Eds.), Representation and understanding: studies in cognitive science. New York: Academic Press, 185-210. Also In: Ronald Brachman and Hector Levesque, editors, Readings in Knowledge Representation, pages 357-370. Morgan
Reasoning from incomplete knowledge in a procedural deductive system
Also see book version (1980), IJCAI-77. Also Rep. No. TR-347, AI Laboratory, Massachusetts Institute of Technology.
Grammatical Inference: Introduction and Survey Parts I and II
IEEE Transwactions on Systems, Man and Cybernetics SMC-5, pp. 409-425