
Introduction 9
In Chapter 14, Kanellakis surveys logic programming and parallel com-
plexity. The problems addressed are related to query optimization for deduc-
tive databases and to fast parallel execution of primitive operations in logic
programming such as fixpoint operators, term unification, and term matching.
There are many computational issues in logic programming and deductive
databases. The chapter provides both the detailed results and many open
problems that exist.
The concepts of unification and most general unifier are fundamental in
automated theorem proving, logic programming, and deductive databases. In
Chapter 15, Lassez, Mäher ...