Non-transformational termination analysis of logic programs, based on general term-orderings

DOI10.1007/3-540-45142-0_5MaRDI QIDQ4421872zbMATH OpenFDO

Authors Alexander Serebrenik, Daniel De Schreye

Publication date 1 September 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2042/20420069.htm, https://lirias.kuleuven.be/handle/123456789/124446

zbMATH Keywords

acceptabilityterm-orderingstermination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Acceptability with general orderings
• Automated Termination Analysis for Logic Programs by Term Rewriting
• Automated termination proofs for logic programs by term rewriting
• A general framework for automatic termination analysis od logic programs
• On modular termination proofs of general logic programs

Cited in

(3)

• Acceptability with general orderings
• Static Analysis
• Termination of floating-point computations

This page was built for publication: Non-transformational termination analysis of logic programs, based on general term-orderings

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