Skip to Main Content
Foundations of Deductive Databases and Logic Programming
book

Foundations of Deductive Databases and Logic Programming

by Jack Minker
May 2014
Intermediate to advanced content levelIntermediate to advanced
752 pages
35h 3m
English
Morgan Kaufmann
Content preview from Foundations of Deductive Databases and Logic Programming
Chapter
14:
Logic Programming
and
Parallel Complexity
551
[1965].
Robinson's unification algorithm required time exponential in the size
of terms. The following years saw a sequence of unification algorithms cul-
minating with the linear-time algorithm of Paterson and Wegman [1978].
Unification can also be generalized to higher-order logics and equational
theories (Huet and Oppen [1980]). These generalizations, although quite inter-
esting, usually lead to hard computational questions outside PTIME. We con-
centrate on parallel (first-order uninterpreted) unification, and we review the
lower and upper bounds appearing in Dwork et al. [1984, 1986 ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Concepts and Semantics of Programming Languages 1

Concepts and Semantics of Programming Languages 1

Therese Hardin, Mathieu Jaume, Francois Pessaux, Veronique Viguie Donzeau-Gouge
Handbook of Constraint Programming

Handbook of Constraint Programming

Francesca Rossi, Peter van Beek, Toby Walsh

Publisher Resources

ISBN: 9781483221120