Notice the duplication of work on the last three clauses of the two deriva-
tions.
This inefficiency is avoided in the LT algorithm. We can also avoid this
and other inefficiencies by employing better theorem proving techniques, such
as the connection graph proof procedure (Kowalski [1975]), in our method.
Correctness
and
Completeness
of the
Consistency
Method
Recall that, according to our definition of constraint satisfaction, database D
satisfies constraints I if and only if Comp(D) U I is consistent. In this section
we discuss the correctness and completeness of our integrity checking method
(as formalized by the inferenc ...
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.