scientific article; zbMATH DE number 1973218

MaRDI QIDQ4421872zbMATH OpenFDO

Authors Alexander Serebrenik, Danny De Schreye

Publication date 1 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2042/20420069.htm

zbMATH Keywords

acceptabilityterm-orderingstermination analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1926607
• 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)

• scientific article; zbMATH DE number 1926607 (Why is no real title available?)
• Static Analysis
• Termination of floating-point computations

This page was built for publication:

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