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
232 Topor and Sonenberg
Proof:
1.
By Theorem
3,
W is safe. Thus, each c
t
is in dom(W
f
Î) = dom(W,I) and
is hence in L.
2.
Let A V be a statement in D and θ = {x
x
lc
v
...,x
m
lc
m
) a ground
substitution for the variables in A and free variables in V. Then ΑΘ is in
T
D
(I) (resp., Γ
0
(/')) if and only if V6 is true wit / (resp., /'). By part
(a),
we may assume that each c
{
is in L. By Theorem
3,
V is domain in-
dependent, so V0 is true wit / if and only if V0 is true wit /'. The result
follows immediately.
THEOREM
7
Every allowed stratified database is domain independent.
Proof:
Let D be an allowed stratified database and L<L' languages that ex-
ten ...
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