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
548
Kanellakis
2.
Given a linear single rule program, we show that it is NP-hard to decide
whether its stage function is 0(1). This complements the bounded recur-
sion analysis of Ioannidis and Naughton.
Introduction
Programming in logic has been a fundamental theme in computer science
theory and practice ever since their early days and is, in large part, motivated
by the elegant and precise qualities of mathematical logic. The 1965 seminal
paper, "A Machine Oriented Logic Based on the Resolution Principle," by
J.A. Robinson, was a breakthrough in theorem proving and in the use of first-
order predicate calculus as a programming language (Robinso ...
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