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 361
dure in these cases can be implemented with efficiencies comparable to that of
Prolog implementations, as described in Kowalski, Sadri, and Soper [1987].
We have not yet proved the analogue of Theorem 5 for the general case.
The main difficulty comes from the need to generalize the and-tree in the proof
of Theorem 4 to a tree including auxiliary proofs of negation as failure. These
auxiliary proofs are not simple and-trees but include entire finitely failed search
spaces. This suggests that we may be able to deal with this case by converting
finitely failed search spaces into direct proofs of negative condition ...
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