Elsevier

Artificial Intelligence

Volume 30, Issue 3, December 1986, Pages 343-389
Artificial Intelligence

Controlling recursive inference

https://doi.org/10.1016/0004-3702(86)90003-2Get rights and content

Abstract

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 processed 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.

References (29)

  • W.J. Clancey

    The epistemology of a rule-based expert system

    Artificial Intelligence

    (1983)
  • R. Davis

    Meta-rules: reasoning about control

    Artificial Intelligence

    (1980)
  • J. Minker et al.

    On recursive axioms in deductive databases

    Information Systems

    (1983)
  • F. Black

    A deductive question-answering system

  • C.L. Chang

    On evaluation of queries containing derived relations in a relational database

  • J. Doyle

    A model for deliberation, action, and introspection

  • R.W. Floyd

    Assigning meaning to programs

  • H. Gelernter

    Realization of a geometry-theorem proving machine

  • M.R. Genesereth

    The use of design descriptions in automated diagnosis

    Artificial Intelligence

    (1985)
  • M.R. Genesereth et al.

    Procedural hints in the control of reasoning

  • P.J. Hayes

    Computation and deduction

  • L. Henschen et al.

    Compiling queries in recursive first order databases

    J. ACM

    (1984)
  • Kramer, G., Personal communication,...
  • H.R. Lewis

    Cycles of unifiability and decidability by resolution

  • Cited by (35)

    • Application of distributed graph transformations to automated generation of control patterns for intelligent lighting systems

      2017, Journal of Computational Science
      Citation Excerpt :

      Actual graph transformations which provide means for dynamic intelligent control are split into the following stages: Splitting the control process into stages prevents recursive inference [31]. That makes it suitable for implementation of the inference engine and transformations directly in a resource-constrained street light controller.

    • Loop checks for logic programs with functions

      2001, Theoretical Computer Science
    • Oracle semantics for prolog

      1995, Information and Computation
    • Termination of logic programs: the never-ending story

      1994, The Journal of Logic Programming
    • Satisfiability of the smallest binary program

      1993, Information Processing Letters
    View all citing articles on Scopus
    View full text