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
if a universal sentence φ of L has a model it has one which differs from a
Herbrand model only by having equality assigned to a congruence relation on
U
L
. Let us call this a Herbrand /quotient model. And if φ does not contain the
equality symbol this congruence relation can be taken to be identity, i.e., the
model can be a Herbrand model. This is the typical situation in Wysiwym logic
programming. There the program Ρ is a conjunction of a finite set of clauses
which are implicitly universally quantified, the query Q is an existential sen-
tence and neither Ρ nor Q contains the equality symbol. So th
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