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
218 Topor and Sonenberg
answer whatever the domain of the interpretation. Such queries have been
called ''domain independent" and have been extensively studied (for example,
see Nicolas and Demolombe [1983]). Simple examples of unreasonable queries
are \/xp(x), whose truth depends on the domain of x, and\ρ(χ,α), whose set
of correct answers depends on the domain of x.
In Topor [1986] it was observed that, for similar reasons, only certain
deductive databases could be regarded as reasonable, and the concept of
domain independent formulas was extended to that of domain independent
databases. A class of ''allowed'' databases was introduced,
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