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
48
Shepherdson
tive literals true in all Herbrand(Lp) models is the same as the set of positive
literals true in all models of comp(P), which is recursively enumerable.)
There is a very neat fixpoint characterization of the Herbrand models of
comp(P) in terms of the operator T
p
defined in section 5:
THEOREM 14
The Herbrand models of comp(P) are the fixpoints of T
p
.
Proof:
Note that the result is true whatever language is used for Ρ and
comp(P). This is almost obvious in view of our remark above in the section on
fixpoint models that an interpretation I is a fixpoint of T
p
iff it is a supported
model of P, since "supported" is equivalent to
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