Unfolding the Mystery of Mergesort

  • N. Lindenstrauss
  • Y. Sagiv
  • A. Serebrenik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1463)

Abstract

This paper outlines a fully automatic transformation for proving termination of queries to a class of logic programs, for which existing methods do not work directly. The transformation consists of creating adorned clauses and unfolding. In general, the transformation may improve termination behavior by pruning infinite branches from the LD-tree. Conditions are given under which the transformation preserves termination behavior. The work presented here has been done in the framework of the TermiLog system, and it complements the algorithms described in [12].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • N. Lindenstrauss
    • 1
  • Y. Sagiv
    • 1
  • A. Serebrenik
    • 1
  1. 1.Dept. of Computer ScienceHebrew UniversityJerusalemIsrael

Personalised recommendations