Using Active Connection Graphs for Reasoning with Recursive Rules
Proceedings of the Seventh International Joint Conference on Artificial Intelligence. INFERENCE and REASONING. Pages 368-373.
Abstract
Recursive rules, such as "Your parents' ancestors are your ancestors", although very useful for theorem proving, natural language understanding, question-answering and information retrieval systems, present problems for many such systems, either causing infinite loops or requiring that arbitrarily many copies of them be made. SNIP, the SNePS Inference Package, can use recursive rules without either of these problems. A recursive rule causes a cycle to be built in an active connection &raph. Each pass of data through the cycle results in another answer. Cycling stops as soon as either the desired answer is produced, no more answers can be produced or resource bounds are exceeded.
@inproceedings{ijcai1981p72,
title = {Using Active Connection Graphs for Reasoning with Recursive Rules},
author = {McKay, Donald P. and Shapiro, Stuart C.},
booktitle = {Proceedings of the Seventh International Joint Conference on
Artificial Intelligence, {IJCAI-81}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Roger C. Schank},
pages = {368--373},
year = {1981},
month = {8},
note = {INFERENCE and REASONING},
url = {https://ijcai.org/proceedings/1981/72},
}
TY - CPAPER TI - Using Active Connection Graphs for Reasoning with Recursive Rules AU - McKay, Donald P. AU - Shapiro, Stuart C. T2 - Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81 PB - International Joint Conferences on Artificial Intelligence PY - 1981 SP - 368 EP - 373 UR - https://ijcai.org/proceedings/1981/72 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
