Eliminating unwanted loops in Prolog

  • Authors:
  • Michael A. Covington

  • Affiliations:
  • University of Georgia, Athens, Georgia

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

Modifications to Prolog are proposed that make it possible to express transitive and symmetrical relations and biconditionals. This is done by blocking recursion under circumstances that would lead to infinite loops.