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
Chapter
1
:
Negation in Logic Programming
Finally we note that the occur axiom, OA,t(x) Φ χ is redundant if DCA is
used, i.e.,
EA U FA U DCA OA.
This is not true if DCA is replaced by WDCA; e.g., with constants 0,s, the
formula s(x) Φ χ is not provable from EA U FA U WDCA, for this has a
model consisting of the natural numbers together with an element ω such that
s(<o) = ω.
The closed world assumption, as well as possibly having no computable
proof procedure, is often considered to be too strong a presumption in favor of
negative information. And if there is indefinite knowledge about ground atoms,
then cwa(P) is inconsistent; e.g., if Ρ
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