scientific article; zbMATH DE number 517070

MaRDI QIDQ4282600zbMATH OpenFDO

Authors Stefan Brüning

Publication date 17 March 1994

zbMATH Keywords

automated theorem provingconnection calculiinfinite loopslogic programmingproof of Horn formulas

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Restricting backtracking in connection calculi
• On the Connection Constants
• On Van Gelder's loop detection algorithm
• Programming Languages and Systems
• scientific article; zbMATH DE number 4035120
• scientific article; zbMATH DE number 1098500
• Loop detection by logically constrained term rewriting
• Connection Scan Algorithm
• Termination detection in parallel loop nests with while loops

Cited in

(5)

• Efficient loop detection in prolog using the tortoise-and-hare technique
• Two loop detection mechanisms: a comparison
• Connection Scan Algorithm
• \textsf{Ko\(_{\mathsf{M}}\)eT}
• Detecting Loops During Proof Search in Propositional Affine Logic

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