
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 ...