Correctness of unification without occur check in prolog

DOI10.1016/0743-1066(94)90048-5MaRDI QIDQ4285641zbMATH OpenOpenAlexFDO

Authors Ritu Chadha, David A. Plaisted

Publication date 17 April 1994

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

Full work available at URL https://doi.org/10.1016/0743-1066(94)90048-5

zbMATH Keywords

occur checkPrologunification algorithms

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Semantics for logic programs without occur check
• scientific article; zbMATH DE number 4060686
• scientific article; zbMATH DE number 4060703
• The occur-check problem in Prolog
• Unifying correctness statements
• Polyvariant detection of uninitialized arguments of prolog predicates
• The Qu-Prolog unification algorithm: formalisation and correctness
• Unifying Recursion in Partial, Total and General Correctness
• Correctness and completeness of logic programs
• Strategies for consistency checking based on unification

Cited in

(8)

• The occur-check problem in Prolog
• The occur-check problem revisited
• scientific article; zbMATH DE number 4060686 (Why is no real title available?)
• scientific article; zbMATH DE number 4060703 (Why is no real title available?)
• Verification of logic programs with delay declarations
• A relaxed condition for avoiding the occur-check
• A note on occur-check
• Semantics for logic programs without occur check

This page was built for publication: Correctness of unification without occur check in prolog

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