Non-termination inference for constraint logic programs

DOI10.1007/978-3-540-27864-1_27MaRDI QIDQ5466573zbMATH OpenOpenAlexFDO

Authors Étienne Payet, Fred Mesnard

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99688

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1223557
• A non-termination criterion for binary constraint logic programs
• Termination of constraint logic programs
• A practical analysis of non-termination in large logic programs
• A new approach to non-termination analysis of logic programs
• On proving left termination of constraint logic programs
• scientific article; zbMATH DE number 3995083
• Non-transformational termination analysis of logic programs, based on general term-orderings
• A framework to incorporate non-monotonic reasoning into constraint logic programming

Cited in

(9)

• scientific article; zbMATH DE number 458994 (Why is no real title available?)
• A non-termination criterion for binary constraint logic programs
• scientific article; zbMATH DE number 1223557 (Why is no real title available?)
• Termination of constraint logic programs
• cTI: a constraint-based termination inference tool for ISO-Prolog
• On proving left termination of constraint logic programs
• On the existence of nonterminating queries for a restricted class of PROLOG-clauses
• Non-termination in Term Rewriting and Logic Programming
• Loop detection in term rewriting using the eliminating unfoldings

This page was built for publication: Non-termination inference for constraint logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466573)