Lawrence J. Henschen

TL;DR: The research reported in this paper presents a solution to an open problem which arises in sys-tems that use recursive production rules to re-present knowledge that uses connection graphs to first detect occurrences of recursive definitions and then synthesizes a non-recursive program from such a definition.

TL;DR: Level-Cycle Merging method is an extension of the counting method to process linear recursive queries in both cyclic and acyclic databases and shows that it compares favorably with other recently developed cyclic counting techniques.

TL;DR: It is proved that the algorithm generates all the answers under the GCWA when answering recursive queries under the Generalized Closed World Assumption in a database with positive non-Horn ground clauses.