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
324
Sadri
and
Kowalski
Figure 2 represents an alternative search space for the same input set with
the negated fact "NOT P(C)" as top clause:
NOTP(C)
(10)
<- T(C)
I
(3)
<-Q(C)
I
(2)
<-MiQ and NOTN(C)
"""""j (6)
<~ NOT N(C)
j (negation as failure)
[]
Figure
2: A
Search
Space
for
Example
5
with
a
Negated
Fact
as Top
Clause
Both diagrams show that Comp(D) U I is inconsistent. The second one
shows that the finite failure of fact P(C) contributes to an inconsistency.
In the next section, we introduce our integrity checking method through a
series of examples. The description of the method in the general case is
presented in "Formalizing 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.
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