a simple characterization of uniform boundedness for a class of recursions：一类递归的一致有界性简单的表征.pdfVIP

J. LOGIC PROGRAMMING 1991:10:233-253 233 A SIMPLE CHARACTERIZATION OF UNIFORM BOUNDEDNESS FOR A CLASS OF RECURSIONS JEFFREY F. NAUGHTON* AND YEHOSHUA SAGIV’ D Detecting bounded recursions is a powerful optimization technique for recursive database query languages, as bounded recursions can be re- placed by equivalent nonrecursive definitions. The problem is also of theoretical interest in that varying the class of recursions considered generates problem instances that vary from linearly decidable to NP-hard to undecidable. In this paper we review and clarify the existing definitions of boundedness. We then specify a class of recursions C such that membership in C guarantees that a certain simple condition is necessary and sufficient for boundedness. We use the notion of membership in C to unify and extend previous work on determining decidable classes of bounded recursions. a 1. INTRODUCTION In recent years there has been a growing body of literature investigating the use of function-free Horn clauses as a deductive database query language. Many practical yet theoretically interesting problems have arisen in this area; one of these is the bounded recursio