Inferring Termination Conditions for Logic Programs Using Backwards Analysis

DOI10.1007/3-540-45653-8_47zbMath1275.68046arXivcs/0312023OpenAlexW1496121453MaRDI QIDQ2996201

Samir Genaim, Michael Codish

Publication date: 6 May 2011

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0312023

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Loop detection in term rewriting using the eliminating unfoldings ⋮ Analysis of Linear Hybrid Systems in CLP