Meltzer, Bernard


Knowledge and Experience in Artificial Intelligence

AI Magazine

The period since the last conference in this series has been characterized by the explosive expansion of AI out of the confines of institutions of basic research like university departments into the worlds of industry, business, and government (a development I had long expected). But it seems to me that there are plenty -- perhaps an overabundance -- of other occasions, other conferences. Other workshops, and like, at which the applications of AI would appropriately be considered.


Letters to the Editor

AI Magazine

Jim Kornell, Robert Park, Christopher Dungan, Joop Schopman, David Drager, Nils J. Nilsson, Marty Kalin, John Gavin, Bernard Meltzer, Robert Salmansohn, Keith McCammon, Loren Martindale Abstract Subjects include AI's impact on employment, the AAAI conference, a response to McCarthy's Presidential Message, AI going public, and computerless expert systems. Subjects include AI's impact on employment, the AAAI conference, a response to McCarthy's Presidential Message, AI going public, and computerless expert systems.


Letters to the Editor

AI Magazine

Letters to the Editor Jim Kornell, Robert Park, Christopher Dungan, Joop Schopman, David Drager, Nils J. Nilsson, Marty Kalin, John Gavin, Bernard Meltzer, Robert Salmansohn, Keith McCammon, Loren Martindale Abstract Subjects include AI's impact on employment, the AAAI conference, a response to McCarthy's Presidential Message, AI going public, and computerless expert systems. Subjects include AI's impact on employment, the AAAI conference, a response to McCarthy's Presidential Message, AI going public, and computerless expert systems.


Machine Intelligence 4

Classics

Several workers in recent years have considered using techniques and ideas of various mathematical theories of computation for proving interesting results about computer programs. These predicates may be thought of as expressing the relevant relations between the values of the variables of interest at the given point; in particular, the predicate on the exit point represents the property of the program we wish to prove. In a program scheme we have a set of registers L1, L2,.. L„, a set of function names ft,,f2, -. fp, and a set of test names ti, t2,..