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 339
lead to finitely failed search spaces, and our method is complete for the given
case,
then the transaction satisfies the constraints.
We believe that our method is as complete as SLDNF. We will discuss this
point later in "Correctness and Completeness of the Consistency Method."
SLDNF has been proved complete for several restricted classes of databases
(Clark [1978], Jaffar, Lassez, and Lloyd [1983]), which include hierarchical
databases such as those before and after the update in the following example.
(A database is hierarchical if it contains no recursion. See Clark [1978] for a
more precise definition. ...
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