Proving Termination for Logic Programs by the Query-Mapping Pairs Approach

Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik. Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. In Maurice Bruynooghe, Kung-Kiu Lau, editors, Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development. Volume 3049 of Lecture Notes in Computer Science, pages 453-498, Springer, 2004. [doi]

Abstract

Abstract is missing.