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
1
:
Negation
in
Logic
Programming
63
Indeed it is obvious from the remarks above that gfp(T
p
) is such a model. It
follows from the above that comp(P) has a η-generic Herbrand model iff
T
p
I
ω = gfp(Tp), i.e., iff it is canonical.
Programs
for
which
Negation as Failure Is Complete wrt the
Completed
Database
In view of the popularity of the use of negation as failure, and the view that it
is really comp(P) you are talking about, it is useful to know classes of
programs for which negation as failure is complete, for classical negation, rela-
tive to comp(P).
The completeness results in the last subsection for definite Horn programs
wer
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