Acceptability with general orderings

DOI10.1007/3-540-45628-7_9MaRDI QIDQ4707739zbMATH OpenFDO

Authors Alexander Serebrenik, Daniel De Schreye

Publication date 11 June 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/2407/24070187.htm

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Non-transformational termination analysis of logic programs, based on general term-orderings
• Automated termination proofs for logic programs by term rewriting
• Proving termination of general Prolog programs
• scientific article; zbMATH DE number 1497821
• On modular termination proofs of general logic programs

Cited in

(3)

• Non-transformational termination analysis of logic programs, based on general term-orderings
• scientific article; zbMATH DE number 1497821 (Why is no real title available?)
• Termination Analysis of Logic Programs Based on Dependency Graphs

This page was built for publication: Acceptability with general orderings

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