scientific article; zbMATH DE number 4176501

MaRDI QIDQ3200592zbMATH OpenFDO

Authors Lutz Plümer

Publication date 1989

zbMATH Keywords

answer substitutionautomated termination proofsProlog programs

Mathematics Subject Classification ID

Logic programming (68N17) Artificial intelligence (68T99)

Recommendations

• Termination proofs for logic programs
• Automated modular termination proofs for real Prolog programs
• A general framework for automatic termination analysis od logic programs
• Norms on terms and their use in proving universal termination of a logic program
• scientific article; zbMATH DE number 3924108

Cited in

(1)

• Inference of Termination Conditions for Numerical Loops in Prolog

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 Q3200592)