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
Henschen and Park
DBs similar in spirit to compilation for Horn databases (Chang [1981],
Henschen and Naqvi [1984], Reiter [1978a]).
Indefinite
Databases and GCWA
Inference
In this paper, we use the following notations: Ρ and R, ... for arbitrary predi-
cate symbols; w, v, w,
JC,
... for vectors of variables; a, b, c, ... for vectors of
constants; CL for a clause; Κ for a ground clause; "DB \- β" for "Q is a
logical consequence of DB"; "DB \+- β" for "β is not a logical con-
sequence of DB"; "DB
HQCWA
"
r
'~ι Ô
can De
assumed by
GCWA"; and "DB
h/-Gc
WA
—iß" for "—\Q cannot be assumed by
GCWA." A clause may be written as a list of literals
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