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
156 Van
Gelder
In each remaining rule in RR
k + p
delete all positive subgoals that appear
in
SS
k+
j and delete all negative subgoals that appear in FS
k + x
; these
subgoals are considered proved and the rules "shrink" accordingly.
This completes the description of the transformation Φ(55^, FS
k
, RR
k
).
Figure 2 illustrates the operation of Φ.
For each limit ordinal a, we define
55
a
= U SS„ FS
a
= U FS, RR
a
= Π RR*.
β < a β < a ß<a
Let Ω be the least nonconstructive ordinal, and define
55 = (J 55
ß
FS = U FSp.
β < Ω β < Ω
Also,
we say an atom in the Herbrand universe is unclassified if it is in neither
55 nor FS.
DEFINITION 5
The rule-based negation-as-failure ...
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