Automated termination analysis for logic programs with cut

DOI10.1017/S1471068410000165zbMath1209.68098arXiv1007.4908OpenAlexW2128219525MaRDI QIDQ3585154

René Thiemann, Peter Schneider-Kamp, Alexander Serebrenik, Thomas Ströder, Jürgen Giesl

Publication date: 19 August 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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

zbMATH Keywords

cutdefinite logic programsautomated termination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Checking termination of bottom-up evaluation of logic programs with function symbols, Using linear constraints for logic program termination analysis, Dependency Triples for Improving Termination Analysis of Logic Programs with Cut, A practical analysis of non-termination in large logic programs, Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments, Proving completeness of logic programs with the cut, A framework for computing finite SLD trees, A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems