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
The
Relation
between the Closed World
Assumption
and the
Completed
Database
The closed world assumption, cwa(P), and the completed database, comp(P),
are superficially similar. They are both examples of reasoning by default, as-
suming that if some positive piece of information cannot be proved in a certain
way from P, then it is not true. But for cwa(P), the notion of proof involved is
that of full first order logic, whereas for comp(P), it is "using one of the
program clauses whose head matches the given atom." At first sight this is a
narrower notion of proof so that more ground atoms should be false under
comp(P) than under cwa(P) ...
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