Performing Inferences over Recursive Data Bases

Shamim A. Naqvl, Lawrence J. Henschen

The research reported in this paper presents a solution to an open problem which arises in systems that use recursive production rules to represent knowledge. The problem can be stated as follows: "Given a recursive definition, how can we derive an equivalent non-recursive program with well-defined termination conditions". Our solution uses connection graphs to first detect occurrences of recursive definitions and then synthesizes a non-recursive program from such a definition.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.