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
159
We observe that p(2) is in all models. However, the rule-based semantics
leaves a, and hence p, completely unclassified. The problem is that one of the
cases set{a(2),
—ια(2)}
must hold but the semantics is not powerful enough to
use this information.
Tree-oriented
Semantics
for
Negation
as
Failure
In this section we consider semantics in which remaining rules sets (RR
k
) are
replaced by sets of "remaining proof trees." First we define a simple tree
semantics that is equivalent to the rule semantics of Definition 5 in the sense
that it produces the same SS
k
and FS
k
. Then we propos
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