Modular termination proofs for prolog with tabling

DOI10.1007/10704567_21MaRDI QIDQ4494370zbMATH OpenFDO

Authors Sofie Verbaeten, K. Sagonas, Daniel De Schreye

Publication date 12 March 2001

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

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

zbMATH Keywords

logic programstabling

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Termination proofs for logic programs with tabling
• Termination of simply-moded well-typed logic programs under a tabled execution mechanism
• Termination analysis of tabled logic programs using mode and type information
• Tabled evaluation with delaying for general logic programs
• scientific article; zbMATH DE number 879005

Cited in

(6)

• Tabling, rational terms, and coinduction finally together!
• Automated modular termination proofs for real Prolog programs
• Failure tabled constraint logic programming by interpolation
• An External Module for Implementing Linear Tabling in Prolog
• Termination proofs for logic programs with tabling
• Termination of simply-moded well-typed logic programs under a tabled execution mechanism

This page was built for publication: Modular termination proofs for prolog with tabling

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