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
646
Maher
On the other hand, logical equivalence of programs is not stronger than
equivalence of completions: {A B) and {A B; A A} are logically
equivalent but their completions are not.
Often we wish to use a program as part of a larger program. To express the
fact that two programs will perform identically as subprograms we define, for
each equivalence ~ defined above, that two programs P
{
and P
2
are equivalent
as program segments iff P
{
Ug-^ U Q for every finite program Q. Clearly
any equivalence as program segments is stronger than the corresponding equiv-
alence (by taking Q = 0). In some cases, the two concepts are the same. For
example ...
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