Correctness of unification without occur check in prolog

DOI10.1016/0743-1066(94)90048-5zbMATH Open0794.68021OpenAlexW2084591797MaRDI QIDQ4285641FDOQ4285641

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

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

zbMATH Keywords

Prologoccur checkunification algorithms

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (8)

• The occur-check problem in Prolog
• Title not available (Why is that?)
• Title not available (Why is that?)
• The occur-check problem revisited
• A relaxed condition for avoiding the occur-check
• Semantics for logic programs without occur check
• A note on occur-check
• Verification of logic programs with delay declarations

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)