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
Shepherdson
2. Follows from (1) and Theorem 16.
3.
The soundness half of (3) is Theorem 25 (1), the completeness is due to
Jaffar, Lassez, and Lloyd [1983], and appears in Lloyd [1984] as
Theorem 16.1, pp.
82-83.
Although following Jaffar, Lassez, and Lloyd, we have called this a com-
pleteness result for negation as failure, it has nothing to do with the use of the
negation as failure rule in a computation. Since the query and the program
clauses are all totally positive, the rule of negation as failure is never invoked
in the computation. The only thing the result has to do with negation is that it
tells us when a positive query fails unde ...
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