{"type":"ScholarlyArticle","title":"Using Active Connection Graphs for Reasoning with Recursive Rules","authors":[{"name":"Donald P. McKay","slug":"donald-p-mckay","given":"Donald P.","family":"McKay","affiliation":""},{"name":"Stuart C. Shapiro","slug":"stuart-c-shapiro","given":"Stuart C.","family":"Shapiro","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1981/72","pdf":"https://ijcai.org/proceedings/1981/0072.pdf","markdown":"https://ijcai.org/proceedings/1981/72.md","bibtex":"https://ijcai.org/proceedings/1981/bibtex/72","volume":{"slug":"1981","title":"Proceedings of the Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1981","url":"https://ijcai.org/proceedings/1981/","year":1981,"location":"Vancouver, British Columbia, Canada","dates":"24-28 August 1981","editors":"Roger C. Schank","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"INFERENCE and REASONING","track":"INFERENCE and REASONING","number":72,"pages":{"first":368,"last":373},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}