Left termination turned into termination

DOI10.1016/0304-3975(94)90059-0MaRDI QIDQ1318730zbMATH OpenOpenAlexFDO

Authors Kees Doets

Publication date 5 April 1994

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://pure.uva.nl/ws/files/2906656/192_2611y.pdf

zbMATH Keywords

terminationtotal recursive functionslogic programsprogram transformation

Mathematics Subject Classification ID

Logic programming (68N17) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 1142320 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• Canonical logic programs
• Strong termination of logic programs

Cited in

(2)

• A slight strengthening of a theorem of Blair and Kunen
• Summarization for termination: No return!

This page was built for publication: Left termination turned into termination

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