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
318
Sadri
and
Kowalski
form P(x! ..x
n
) for every n-ary predicate Ρ in the underlying language
which is not defined in the database (i.e., does not occur in the conclusion of a
deductive rule). In practice, for convenience, only the database is represented
explicitly and reasoning with its completion is implemented through the nega-
tion as finite failure rule (Clark [1978]).
Our method appeals to an alternative definition of constraint satisfaction.
According to this definition, a database D satisfies integrity constraints I if and
only if the completion of D is consistent with I. We call this the consistency
view of constraint satisfaction ...
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