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
SIGMOD/PODS/ 1988
Conference paper
THE COMPLEXITY OF ORDERING SUBGOALS
Abstract
Selection of an appropriate order for the evaluation of subgoals in a logical rule frequently is essential for efficiency We formulate the problem as one of feasible subgoal orders and show that the question is inherently exponential in time The proof is by reduction from linear-space alternating Turing machine recognition, which appears to be far easier, in this case, than the more obvious reduction from exponential-time (ordinary) Turing machines