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
T^(I) = Tp(I) U I and is more appropriate than T
p
when that is nonmonotonic.)
The other definition starts by defining M(Pj) as the intersection of all Herbrand
models of P
p
then M(P) as the intersection of all Herbrand models of P
2
whose
intersection with the Herbrand base of Pj is M(Pj), then M(P
n
) as the inter-
section of all Herbrand models of P
n
whose intersection with the Herbrand base
of P
n
_ j is M(P
n
_ j). Finally define M
p
= M(P
n
). For the program above, this
model is {q}, which does seem to be better in accordance with default reason-
ing than the other minimal model of comp(P), namely {p}. There is no reason
to suppose
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