A non-termination criterion for binary constraint logic programs

DOI10.1017/S1471068409003652zbMath1166.68008OpenAlexW2027825679MaRDI QIDQ3621267

Étienne Payet, Fred Mesnard

Publication date: 15 April 2009

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

Full work available at URL: https://doi.org/10.1017/s1471068409003652

zbMATH Keywords

constraintsconstraint logic programmingnon-termination

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Uses Software

• CUTE
• DART

Cites Work

• On the existence of nonterminating queries for a restricted class of PROLOG-clauses
• Termination of string rewriting proved automatically
• Loop detection in term rewriting using the eliminating unfoldings
• An analysis of loop checking mechanisms for logic programs
• Proving non-termination
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• A semantic basis for the termination analysis of logic programs
• On proving left termination of constraint logic programs
• Loop checks for logic programs with functions

This page was built for publication: A non-termination criterion for binary constraint logic programs