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
Negation
as
Failure
By "negation as failure" or SLDNF-resolution, we mean the result of adding
negation as failure to SLD-resolution, i.e., the query evaluation procedure
described in Clark [1978], where a negative literal is selected only if it is a
ground literal —iA. The next step is then to query A; if A succeeds, then the
evaluation of —iA fails; if A fails on every evaluation path then, —iA suc-
ceeds. Since by König's lemma the evaluation tree is then finite, this is usually
called finite failure to distinguish it from the situation where the evaluation tree
has no successful path but has infinit ...
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