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
Chapter
3:
Negation
as
Failure Using Tight Derivations
171
All
of the
atoms added
to SS
(j)
are in D. and,
because
Ρ is
free from recursive
negation, none
of
these atoms
can
ever match
a
negative subgoal
of a
rule
in
P
(
^
+
.
This establishes
the
monotonicity
of U
p
u)+ in the
domain
D
j9
and
thus
SS
(j)
is the
least fixed point
of U
p
restricted
to
that domain.
The reader will notice that although
F5
(y)
is not
defined,
for all
practical
purposes
the
iterated fixed point semantics treats
D
}
- SS
(j)
as the
failure
set of
THEOREM
3
Let
Ρ be a
general logic program that
has the
bounded term size property
and
is free from recursive negation. Then
the
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