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
600
Lassez,
Mäher,
and
Marriott
LEMMA
3
Any nonempty finite or infinite collection of solvable equation sets has only a
finite number of generalizations, modulo
ä
.
Proof:
Let the collection be {E
x
,...,
£„,...}.
Let [g-] be the set of distinct
generalizations of
{£j,...,
£,·}, modulo ~. Clearly [g
x
] D [g
2
] 2 ··· 2 [g
n
] 2
.... From the above lemma there are only a finite number of elements in [g
x
]
and so this lemma follows.
As a consequence of this lemma, the poset of equation sets modulo « has
no infinite, strictly increasing sequence.
THEOREM 5
Any nonempty, possibly infinite, collection of solvable equation sets has an
msg which is uniqu ...
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