@inproceedings{fe539d519aea406cbdb12a4beba74c7c,
title = "Inferring termination conditions for logic programs using backwards analysis",
abstract = "This paper focuses on the inference of modes for which a logic program is guaranteed to terminate.This generalizes traditional termination analysis where an analyzer tries to verify termination for a specified mode.The contribution is a methodology which combines traditional termination analysis and backwards analysis to obtain termination inference.This leads to a better understanding of termination inference, simplifies its formal justification, and facilitates implementation.We evaluate the application of this approach to enhance an existing termination analyzer to perform also termination inference.",
author = "Samir Genaim and Michael Codish",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2001 ; Conference date: 03-12-2001 Through 07-12-2001",
year = "2001",
month = jan,
day = "1",
doi = "10.1007/3-540-45653-8_47",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "685--694",
editor = "Robert Nieuwenhuis and Andrei Voronkov",
booktitle = "Logic for Programming, Artificial Intelligence, and Reasoning - 8th International Conference, LPAR 2001, Proceedings",
address = "Germany",
}