Logic Programming

DOI10.1007/11562931MaRDI QIDQ5475786zbMATH OpenOpenAlexFDO

Authors Manh Thang Nguyen, Danny De Schreye

Publication date 27 June 2006

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

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

zbMATH Keywords

acceptabilitypolynomial interpretationsTermination analysis

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42)

Recommendations

• Polytool: polynomial interpretations as a basis for termination analysis of logic programs
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Termination Analysis of Logic Programs Based on Dependency Graphs
• A semantic basis for the termination analysis of logic programs
• scientific article; zbMATH DE number 1696776

Cited in

(9)

• Terminating evaluation of logic programs with finite three-valued models
• Polytool: polynomial interpretations as a basis for termination analysis of logic programs
• SAT Solving for Termination Analysis with Polynomial Interpretations
• SAT modulo linear arithmetic for solving polynomial constraints
• Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
• Proving Termination by Invariance Relations
• Automating Termination Proofs for CHR
• Termination Analysis of Logic Programs Based on Dependency Graphs
• A new look at the automatic synthesis of linear ranking functions

This page was built for publication: Logic Programming

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