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
5:
Declarative Semantics
of
Deductive
Databases
195
Minimal
Model
Semantics
The model-theoretic approach is particularly well-understood in the case of the
so called (definite) Horn databases, otherwise known as positive logic
programs, i.e., databases consisting of clauses of the form:
Aj
&A
2
&
...
&A
m
-^C,
with m > 0, and C and
A,
denoting atomic formulas (atoms).
EXAMPLE 1
Suppose that our database DB consists of clauses
Physicist(x) -^Good_mathematician(x)
Physicist(Einstein)
Businessman(Iacocca).
This database has several different models, the largest of which is the model
Af
max
in which both men are at the same time businessmen
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