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
182
Lifschitz
The iterated fixed point construction allows us to single out the canonical
model M
p
from among the minimal models of P; by
itself,
the minimality
condition is not sufficient for defining the canonical model.
The purpose of this paper is to show that the situation becomes quite
dif-
ferent if we take into account some recent work in the theory of circumscrip-
tion (McCarthy [1986], Lifschitz [1986]). Applications of the idea of logical
minimization to formalizing nonmonotonic aspects of commonsense reasoning
have led to introducing some forms of minimization more general than the
simple minimality condition used above. We will emplo ...
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