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
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
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