Bøger i Artificial Intelligence serien

Finally, we have described in detail the extensions needed to the basic influence resolution algorithm in QP theory to oper ate on these extended descriptions. In the next chapter we extend these techniques further, by developing a qualitative perturbation analysis technique that permits us to answer "what ir' control questions;

Previous treatments of Artificial Intelligence (AI) divide the subject into its major areas of application, namely, natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, intelligent data retrieval systems, etc.

The purpose of this catalogue is to promote interaction between members of the AI' community. with no extended discussion of the historical origin of the tool or how it has been used in particular AI programs, The focus is on techniques abstracted from their historical origins.

I am therefore delighted to see that machines of the power of the IBM PC can now run this system, even though these computers are more modestly priced than my 1980 vision of the personal algebra machine.

They address such diverse topics as: computational molecular biology, machine learning, mobile computing, multi-agent systems, planning, numerical computing and dynamical systems, database systems, an alternative to the "formulas as types" approach, program semantics and analysis, and natural language processing.

It is a pleasure and an honor to be able to present this collection of papers to Ray Reiter on the occasion of his 60th birthday.

A monograph for specialists interested in building maintainable knowledge based systems, giving a unified methodology for the design of such systems

Beyond this theoretical basis the scope of the book includes also implementational aspects and a valuation of existing models and systems.

Natural language generation is a field within artificial intelligence which looks ahead to the future when machines will communicate complex thoughts to their human users in a natural way.

Gelernter finished a computer program to prove simple high school geometry theorems. The article by Martin Davis in the first of this series of volumes traces the most influential ideas back to the 'prehistory' of early logical thought showing how these ideas influenced the underlying concepts of most early automatic theorem proving programs.

Like a finite state automaton, an ATN consists of a collection of la beled states and arcs, a distinguished start state and a set of distin guished final states.