Unfolding the mystery of Mergesort

N. Lindenstrauss, Y. Sagiv, A. Serebrenik

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

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 innite 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].

Original languageEnglish
Title of host publicationLogic Program Synthesis and Transformation - 7th International Workshop, LOPSTR 1997, Proceedings
EditorsNorbert E. Fuchs
PublisherSpringer Verlag
Pages206-225
Number of pages20
ISBN (Print)3540650741, 9783540650744
DOIs
StatePublished - 1998
Event7th International Workshop on Logic Program Synthesis and Transformation, LOPSTR 1997 - Leuven, Belgium
Duration: 10 Jul 199712 Jul 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1463
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Workshop on Logic Program Synthesis and Transformation, LOPSTR 1997
Country/TerritoryBelgium
CityLeuven
Period10/07/9712/07/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.

Fingerprint

Dive into the research topics of 'Unfolding the mystery of Mergesort'. Together they form a unique fingerprint.

Cite this