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
9:
Database
Integrity
329
1.
Rank(John Lect)
2.
Rank(Mary Prof)
3.
Proj(John PI)
4.
Proj(Mary P2)
5.
Acc(x VAX) Proj(x PI)
I:
(IC) Rank(x Lect) Proj(x PI)
T:
Insert Proj(Tom PI).
Assume (correctly) that D
0
satisfies the constraint. The integrity constraint
is not in the form required for our integrity checking method. If we use the
constraint as it stands and select the update as top clause, we obtain the search
space shown in Figure 6.
This search space fails to demonstrate any inconsistency. The completion of
the updated database, however, is inconsistent with the integrity constraint be-
cause together they logically imply bot ...
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