@inproceedings{09261ff1537c44afba2aa0de5fdda340,
title = "A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints",
abstract = "This paper presents a declarative semantics which exhibits the termination properties of a logic program. The semantics associates a program with its binary unfoldings — a possibly infinite set of binary clauses. Termination of a program P and goal G is indicated by the absence of an infinite chain in the binary unfoldings of P starting with G. The main contribution is a formal semantic basis for the termination analysis of logic programs which facilitates both design and implementation. As an implementation vehicle we propose a simple meta-interpreter for binary unfoldings and the use of an abstract domain based on symbolic norm constraints. Many of the recently proposed termination analyses for logic programs can be expressed concisely within our approach. To demonstrate our approach we have reformulated the analysis originally described in [13]. The implementation uses a standard library for linear equations over the recels. The combination of binary unfoldings and a constraint solver is shown to significantly simplify the design of the analysis.",
author = "Michael Codish and Cohavit Taboch",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 6th International Conference on Algebraic and Logic Programming, ALP 1997 ; Conference date: 03-09-1997 Through 05-09-1997",
year = "1997",
month = jan,
day = "1",
doi = "10.1007/BFb0027001",
language = "English",
isbn = "3540634592",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "31--45",
editor = "Karl Meinke and Michael Hanus and Jan Heering",
booktitle = "Algebraic and Logic Programming - 6th International Joint Conference ALP 1997 ― HOA 1997, Proceedings",
address = "Germany",
}