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
4
On the Declarative Semantics of Logic
Programs with Negation
Vladimir Lifschitz
Computer Science Department
Stanford University, Stanford,
CA
Abstract
A logic program can be viewed as a set of predicate formulas, and its declara-
tive meaning can be defined by specifying a certain Herbrand model of that
set. For programs without negation, this model is defined either as the
Herbrand model with the minimal set of positive ground atoms, or, equiv-
alently, as the minimal fixed point of a certain operator associated with the
program (van Emden and Kowalski). These solutions do not apply to general
logic programs, because a program wit
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