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
2:
Towards
a
Theory
of
Declarative Knowledge
143
Ζ for the set of the variables occurring in a negative literal of the body.
We say that Ρ satisfies the strong covering axiom if for each of its clauses
XCY
and
ZQY
holds.
The first implication is called in Shepherdson [1984] the covering axiom.
The strong covering axiom ensures that in the SLDNF-resolution only ground
negative literals need be evaluated. We can now formulate our conjecture.
CONJECTURE 1
Let Ρ be a strict stratified program which satisfies the strong covering axiom.
Then for every ground literal L.
comp(P) f= L iff
j
L can be refuted from Ρ by SLDNF-resolution.
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