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
353
and choose the goal
NOT Constraint-Violated
as the top clause of the SLDNF-search space.
Like the Decker algorithm, the LT algorithm needs stopping conditions and
interleaving to increase the likelihood of detecting a violation of integrity.
One of the inefficiencies of the LT method is that some of the information
obtained during the computation of the sets POS and NEG may be thrown
away and have to be recomputed when evaluating the instantiated constraints.
This redundancy is avoided in our simulation of their algorithm. The search
space shown in Figure 17 is obtained with our method when using the secon ...
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