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
10: A
Logic-based
Language
for
Database
Updates
369
Prolog facts can contain variables. In DLP, a Prolog fact such as p(X,a). will
be represented explicitly as the rule p(X,a) true.
A query is a formula of the form C, where C is a conjunction. An
update query is a formula of the form D, where D is a dynamic conjunc-
tion. The variables of a query and an update query are assumed to be existen-
tially quantified over the entire conjunction.
Informal
Introduction
to DLP
The semantics and the proof theory of DLP is a proper extension of the seman-
tics and proof theory of Pure Prolog. We will find it convenient to explain the
informal executio ...
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