Treffer: Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving.

The dissertation “Static Termination Analysis for Prolog using Term Rewriting and SAT Solving” (Schneider-Kamp in Dissertation, RWTH Aachen University, ) presents a fresh approach to automated termination analysis of Prolog programs. This approach is based on the following three main concepts: the use of program transformations to obtain simpler termination problems, a framework for modular termination analysis, and the encoding of search problems into satisfiability of propositional logic (SAT) for efficient generation of ranking functions. [ABSTRACT FROM AUTHOR]

Copyright of KI: Künstliche Intelligenz is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)