Controlling recursive inference
type: Item
instance of: scholarly article
title: Controlling recursive inference
zbMATH Open document ID: 0635.68104
DOI: 10.1016/0004-3702(86)90003-2
author: David E. Smith
author: Michael Genesereth
author: M. L. Ginsberg
published in: Artificial Intelligence
publication date: 1986-01-01T00:00:00Z
review text: Loosely speaking, recursive inference occurs when an inference procedure generates an infinite sequence of similar subgoals. In general, the control of recursive inference involves demonstrating that recursive portions of a search space will not contribute any new answers to the problem beyond a certain level. We first review a well-known syntactic method for controlling repeating inference (inference where the conjuncts processes are instances of their ancestors), provide a proof that it is correct, and discuss the conditions under which the strategy is optimal. We also derive more powerful pruning theorems for cases involving transitivity axioms and cases involving subsumed subgoals. The treatment of repeating inference is followed by consideration of the more difficult problem of recursive inference that does not repeat. Here we show how knowledge of the properties of the relations involved and knowledge about the contents of the system's database can be used to prove that portions of a search space will not contribute any new answers.
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 4035203
zbMATH Keywords: reasoning
zbMATH Keywords: recursive inference
zbMATH Keywords: database
MaRDI profile type: Publication
full work available at URL: 0004-3702(86)90003-2
OpenAlex ID: W2039099537
cites work: Q5578545
cites work: Q5584402
cites work: Q5721424
cites work: On compiling queries in recursive first-order databases
cites work: Deleting Repeated Goals in the Problem Reduction Format
cites work: Q4124327
cites work: Q4157922
cites work: On recursive axioms in deductive databases
cites work: Data independent recursion in deductive databases
cites work: Q3856120
cites work: Controlling backward inference
cites work: Implementation of logical query languages for databases
description: scientific article; zbMATH DE number 4035203