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
620
Lassez,
Mäher,
and
Marriott
Proof:
(=»
If Ij is effectively ground, then μ
;
is a grounding substitution and so t μ
]
is
unrestricted w.r.t. t.
)
If lj is not effectively ground there exists ν Ε rangefa). As μ
7
is an idem-
potent mgu, ν φ domainfaj) and ν Ε varsit). Thus, ν appears more than once
in {v^j :
V;
Ε vars(f)} and so ίμ· is restricted w.r.t. r.
LEMMA
11
Any inequation in a solvable system with an mgss is either effectively ground
or redundant.
Proof:
Let the system S consist of equation set Ε and inequations /
p
...,/
n
. Let
μ
Ε
be an idempotent mgu of Ε and let μ, be an idempotent mgu for Ε'
f
. = Ε
(
μ
Ε
.
Clearly soln(E''.) = soln(E U ...
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