Results
Where the really hard problems are
Cheeseman, P. | Kanefsky, B. | Taylor, W.
In IJCAI-91, pp. 331–337.
Finite-state approximation of phrase structure grammars
In ACL- 91, pp. 246–255.
Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services
Artificial Intelligence, 48 (3), 261-97.
Intelligence without representation
See also: (pdf) Artificial Intelligence, 47 (1-3), 139-59
A preliminary analysis of the Soar architecture as a basis for general intelligence
Rosenbloom, P. S. | Laird, J. E. | Newell, A. | McCarl, R.
"In this article we take a step towards providing an analysis of the Soar architecture as a basis for general intelligence. Included are discussions of the basic assumptions underlying the development of Soar, a description of Soar cast in terms of the theoretical idea of multiple levels of description, an example of Soar performing multi-column subtraction, and three analyses of Soar: its natural tasks, the sources of its power, and its scope and limits." Artificial Intelligence, 47, 289-325.
Negotiation in a non-cooperative environment
Kraus, S., Ephrati, E., Lehmann, D.
Artificial Intelligence, 3 (4), 255-81.
Time and time again: The many ways to represent time
Int. J. Intelligent Systems, 6, 341-355
The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression
In Lifschitz, V. (Ed.), Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pp. 359–380. Academic Press.
A survey of algorithmic methods for partially observed Markov decision processes
Annals of Operations Research, 28 (1-4), 47-66.