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
258 Chakravarthy, Grant, and Minker
axiom for a given integrity constraint. We also define the notion of merge
compatibility between an axiom and an integrity constraint.
DEFINITION
1
An integrity constraint IC partially subsumes an axiom A if IC does not sub-
sume the body of A but a subclause of IC+ subsumes the body of A.
To define the notion of a residue we need first the notion of back substitu-
tion. We mentioned earlier, that when the subsumption algorithm is applied to
check if C subsumes D, a substitution θ is applied first to transform D to a
ground clause. Since this transformation assigns a new constant to each vari-
able, it is
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