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
3
Negation as Failure Using Tight
Derivations for General Logic Programs
Allen
Van
Gelder
Stanford University
Stanford,
CA
Abstract
A general logic program is a set of rules that have both positive and negative
subgoals. We define negation in general logic programs as finite failure, but
we limit proof attempts to tight derivations, that is, derivations expressed by
trees in which no node has an identical ancestor. Consequently, many goals
that do not fail finitely in other formulations do fail finitely in ours. Thus the
negation-as-failure rule is strengthened, but at the cost of more careful (and
expensive) program execution. We defin ...
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