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 341
finitely. Thus, assuming that our method is as complete as SLDNF, we can
conclude that the transaction satisfies the constraint.
In the search spaces, we have abbreviated the predicate symbol "Eligible-
for-state-pension" to "E-f-s-p." Each of the three search spaces consists of a
single derivation. The second search space consists only of the top clause, and
the third consists of two clauses.
Updates
that Are
Additions
or
Deletions
of
Integrity
Constraints
It is easy to deal with additions and deletions of integrity constraints. Additions
of constraints are handled exactly as additions of deductive rules. Thus ...
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