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
378
Manchanda and Warren
we are assuming that R is stratifiable. From the definition of stratification (see
Apt, Blair, and Walker [1988]), it follows that the logic program l\
b
U R is
stratifiable. Przymusinski [1988] shows that a stratifiable logic program has ex-
actly one perfect model. Therefore, each state in S always exists and is unique.
Any two sets of states must contain the same number of states, since there is a
bijection between the set of states and the set of all possible sets of facts. This
proves that if Ν is an M-model, then S always exists and is unique.
The current state G is the perfect model of F U R. Once the database ...
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