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
Van
Gelder
Freedom
from
Recursive
Negation
The concept of freedom from recursive negation, defined below, is an impor-
tant one for logic programs, and leads to our first main result. The same con-
cept was developed independently in Apt, Blair, and Walker [1988] and
Naqvi [1986], where it was called "stratified" and "layered," respectively.
Other researchers adopted the term "stratified" (Lifschitz [1988],
Przymusinski [1988]) but we prefer our own more descriptive terminology. In
this section we show that programs that are free from recursive negation and
have the bounded term size property are "categorical" under the tight tree
semantics,
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