
316
Sadri
and
Kowalski
Deletions: The Second Approach" describe two different ways of formalizing
the inference rules needed for reasoning about implicit deletions. In the section
"Comparison with Simplification Methods for Integrity Checking" we com-
pare our method with the Decker and LT algorithms for checking integrity of
deductive databases. Finally, in the last section, we discuss the correctness and
completeness of our method.
Definitions
Deductive
Databases
A deductive database is a finite set of deductive rules, which are closed for-
mulae of the form
Α-·-
Ljand... and L
n
, η > 0,
where A is an atom, the L
4
are literals (i.e.,atoms o