powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage."

powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage.

This volume contains the elaborated and harmonized versions of seven lectures given at the first Advanced Course in Artificial Intelligence, held in Vignieu, France, in July 1985. Most of them were written in tutorial form; the book thus provides an extremely valuable guide to the fundamental aspects of AI. In the first part, Delgrande and Mylopoulos discuss the concept of knowledge and its representation. The second part is devoted to the processing of knowledge. The contribution by Huet shows that both computation and inference or deduction are just different aspects of the same phenomenon. The chapter written by Stickel gives a thorough and knowledgeable introduction to the most important aspects of deduction by some form of resolution. The kind of reasoning that is involved in inductive inference problem solving (or programming) from examples, and in learning, is covered by Biermann. The tutorial by Bibel covers the more important forms of knowledge processing that might play a significant role in common sense reasoning. The third part of the book focuses on logic programming and functional programming. Jorrand presents the language FP2, where term rewriting forms the basis for the semantics of both functional and parallel programming. In the last chapter, Shapiro gives an overview of the current state of concurrent PROLOG.