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
334 Sadri
and
Kowalski
NOT Rank(John Lect)
(IC) rewritten:
<-Proj(x PI) and
NOT Rank(x Lect)
<- Proj(John PI)
Figure
10: A
Search
for
Example
9
with
the
Update
as Top
Clause
reasoning forward from "NOT A." If A is still provable in the updated
database, then the update, which only deletes the explicit occurrence of A,
does not alter the logical content of the database, and there is, therefore, no
need to consider the update as a top clause for integrity checking.
Because of the possible presence of negation by failure in the deductive
rules,
deletion of facts can implicitly add new facts to the database. Using the
extended resolution rule t ...
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