Efficient loop detection in prolog using the tortoise-and-hare technique

DOI10.1016/0743-1066(87)90020-3MaRDI QIDQ3747702zbMATH OpenOpenAlexWikidataFDO

Authors Allen Van Gelder

Publication date 1987

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(87)90020-3

zbMATH Keywords

goal reductionhigh- performance interpretersimplementationinfinite recursionloop detectiontail-recursion optimizationtortoise-and-hare technique

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• scientific article; zbMATH DE number 475191
• scientific article; zbMATH DE number 4182856
• Linear tabulated resolution based on Prolog control strategy
• scientific article; zbMATH DE number 1098500
• scientific article; zbMATH DE number 517070

Cited in

(13)

• An analysis of loop checking mechanisms for logic programs
• Generalizing completeness results for loop checks in logic programming
• Loop checking in SLD-derivations by well-quasi-ordering of goals
• Termination prediction for general logic programs
• Contraction-free sequent calculi for intuitionistic logic
• scientific article; zbMATH DE number 475191 (Why is no real title available?)
• scientific article; zbMATH DE number 2090530 (Why is no real title available?)
• Loop Elimination, a Sound Optimisation Technique for PTTP Related Theorem Proving
• Tracing Prolog programs by source instrumentation is efficient enough
• Primal grammars and unification modulo a binary clause
• scientific article; zbMATH DE number 4182856 (Why is no real title available?)
• On the existence of nonterminating queries for a restricted class of PROLOG-clauses
• Loop checks for logic programs with functions

This page was built for publication: Efficient loop detection in prolog using the tortoise-and-hare technique

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