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
592
Lassez,
Mäher,
and
Marriott
the set of variables appearing in
t
v
...,t
n
.
An element v
f
t
i
of a substitution
is called a binding.
Substitution θ is a grounding substitution if its right hand side (rhs) consists
of ground terms. It is a grounding substitution for W if its domain is W. For
example,
{JC
a,y f(a)} is a grounding substitution for
{x,y}.
A solution, Θ, of equation set Ε = {s
Y
=
t
x
,...,s
n
= t
n
} is a grounding sub-
stitution for V such that = ^θ,.,.,^θ = r
n
6. For example,
{JC
g(a), y—
g(a),
ζ g(g(a))} is a solution of {f(x, z) = f(y, g(y))}. The (possibly
empty) set of solutions of equation set Ε is denoted by soln(E). It
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