Strong termination of logic programs

  • Bezem M
  • 5


    Mendeley users who have this article in their library.
  • 45


    Citations of this article.


We study a powerful class of logic programs which terminate for a large class of goals. Both classes are characterized in a natural way in terms of mappings from variable-free atoms to natural numbers. We present a technique based on this idea which improves the termination behavior and allows a more multidirectional use of Prolog programs. The class of logic programs is shown to be strong enough to compute every total recursive function. The class of goals considerably extends the variable-free ones. © 1993.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Marc Bezem

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free