About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
STOC 1989
Conference paper
Expressiveness of restricted recursive queries
Abstract
We study the effect of various syntactic restrictions on the expressive power of database logic programs. We find natural examples of programs which (i) require recursively defined predicates of arbitrarily large width, (ii) require rules with arbitrarily many recursive calls, or (iii) require nonlinear rules, but can be evaluated in NC2.