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 10: A Logic-based Language for Database Updates 387
2.
The translator
(~p
v
(t))
D is semantically acceptable in Δ if for all
variable assignments s, for all 7,7 Ε S, if (7,7) Ε Λ^(—p
v
(f)M) and 7(=
-!P
v
(0M then 7 = 7.
For example consider the following delete translator η for the edp view.
η
:
(-edp
(
Ename, Dept, Proj
) >
(-ed(Ename,Dept))
(
(-ep(Ename,Proj)>
)
For all values of Ename, Dept, and
Proj,
η returns a state (say 7) in which
ι ep(Ename, Proj ) is true. Recall that the completion of the view definition
is true in every state in an M-model. If
j
ep( Ename, Proj ) is true in 7, then
the completion of the edp view implies
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