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
Shepherdson
above, as recursive definitions of the predicates in their heads, it is the model
which corresponds to these recursive definitions.
In general, however, T
p
is not monotonie and may not have fixpoints. For
example, if Ρ is q -iq, -ir then Τ
ρ
) = {q} but T
p
({q}) = φ; there is
no fixpoint of T
p
and no least Herbrand model—there are two minimal
Herbrand models {q}, {r} (i.e., models with no proper submodel), but their
intersection is not a model.
Although all that is required for I to be a model of Ρ is that T
P
(I) C I i.e.,
that I is a pre-fixpoint of T
p
, fixpoint models have a special interest, par-
ticularly in the context in whic ...
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