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
222 Topor and Sonenberg
in language L. Then M(D,L) is {p(a)} if a is the only constant in L but
M(D,L) is {p(a)
9
q(b)} if a and b are the constants in L.
The model M(D,L) was defined implicitly for stratified general databases by
Chandra and Harel [1985] and explicitly for stratified general programs by Apt,
Blair, and Walker [1988] where it was denoted by M
D
. In each case, they used
for L the language of D. The use of the word "standard" is motivated by a
result in Apt et al. [1988] that states M(D,L) is independent of the level map-
ping used to show D is stratified, by Lifschitz's demonstration that M(D,L)
arises naturally in an attemp
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