Forward chaining logic programming with the ATMS

  • Authors:

  • Nicholas S. Flann;Thomas G. Dietterich;Dan R. Corpron

  • Affiliations:

  • Department of Computer Science, Oregon State University, Corvallis, Oregon;Department of Computer Science, Oregon State University, Corvallis, Oregon;Department of Computer Science, Oregon State University, Corvallis, Oregon

  • Venue:
  • AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two powerful reasoning tools have recently appeared, logic programming and assumption-based truth maintenance systems (ATMS). An ATMS offers significant advantages to a problem solver: assumptions are easily managed and the search for solutions can be carried out in the most general context first and in any order. Logic programming allows us to program a problem solver declaratively--describe what the problem is, rather than describe how to solve the problem. However, we are currently limited when using an ATMS with our problem solvers, because we are forced to describe the problem in terms of a simple language of forward implications. In this paper we present a logic programming language, called FORLOG, that raises the level of programming the ATMS to that of a powerful logic programming language. FORLOG supports the use of "logical variables" and both forward and backward reasoning. FORLOG programs are compiled into a data-flow language (similar to the RETE network) that efficiently implements deKleer's consumer architecture. FORLOG has been implemented in Interlisp-D.