IJCAI 1, 557-567.

Stanford AI Memo 83 or Computer Science Technical Note 130, Computer Science Department, Stanford University, Stanford, CA, 1969

Reading, Mass.: Addison-Wesley.

In IEEE Conference Record of the 1969 Tenth Annual Symposium on Switching and Automata Theory, pp. 74–81.

In Meltzer, Bernard and Donald Michie (Eds.), Machine Intelligence 5. Edinburgh University Press, pp.203-15.

We study some aspects of a general game-playing program. Such a program receives as data the rules of a game: an algorithm enumerating the moves and an algorithm indicating how to win. The program associates to each move the conditions necessary for this move to occur. It must find how to avoid a dangerous move. We describe the part of the program playing the combinatorial game in order to win: how it can find the moves which lead to victory and what are the only opponent's moves with which he does not lose. This program has been tried with various games: chess, tic-tac-too, etc.INFORMATION PROCESSING 68 - NORTH-HOLLAND PUBLISHING COMPANY - AMSTERDAM

A question-answering system. Tech. Note 15, AI Group, Stanford Research Institute, Menlo Park, Calif.

In Meltzer, Bernard and Donald Michie (Eds.), Machine Intelligence 4. Edinburgh University Press.

In Meltzer, Bernard and Donald Michie (Eds.), Machine Intelligence 5. Edinburgh University Press.

This paper shows how a question -answering system can be constructed using first -order logic as its language and a resolution -type theorem -prover as its deductive mechanism. A working computer -program, Q A3, based on these ideas is described. The performance of the program compares favorably with several other general question -answering systems.