Performing Inferences over Recursive Data Bases
Abstract
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. 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. I.
Cite
Text
Naqvi and Henschen. "Performing Inferences over Recursive Data Bases." AAAI Conference on Artificial Intelligence, 1980.Markdown
[Naqvi and Henschen. "Performing Inferences over Recursive Data Bases." AAAI Conference on Artificial Intelligence, 1980.](https://mlanthology.org/aaai/1980/naqvi1980aaai-performing/)BibTeX
@inproceedings{naqvi1980aaai-performing,
title = {{Performing Inferences over Recursive Data Bases}},
author = {Naqvi, Shamim A. and Henschen, Lawrence J.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1980},
pages = {263-265},
url = {https://mlanthology.org/aaai/1980/naqvi1980aaai-performing/}
}