"Using Active Connection Graphs for Reasoning with Recursive Rules," D. McKay and S. Shapiro, Proc. 7th International Joint Conference on Artificial Intelligence, 1981. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On the Power of Magic - Beeri, Ramakrishnan (1987) (102 citations) (Correct)
....values obtained by evaluating par with these bindings are then passed to anc, to generate yet another subgoal. Several strategies have been proposed for evaluating recursive queries expressed using sets of Horn Clauses (rules) Henschen and Naqvi 84] Kifer and Lozinskii 85] Lozinskii 85] McKay and Shapiro 81] Rohmer and Lescoeur 85] Sacca and Zaniolo 86a] Van Gelder 86] Vieille 86] etc. See [Bancilhon and Ramakrishnan 86] for a comprehensive survey. The main thrust of the above strategies is to improve efficiency by restricting the computation to tuples that are related to the query. They ....
"Using Active Connection Graphs for Reasoning with Recursive Rules," D. McKay and S. Shapiro, Proc. 7th International Joint Conference on Artificial Intelligence, 1981.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC