A relaxed condition for avoiding the occur-check

DOI10.1016/j.tcs.2023.114107OpenAlexW4385480272MaRDI QIDQ6076347

Włodzimierz Drabent

Publication date: 21 September 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114107

zbMATH Keywords

unificationlogic programmingSLD-resolutionmodesselection ruleoccur-checkdelays/coroutining

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pearl on SAT and SMT solving in Prolog
• A Gaussian-sum filter for vertex reconstruction
• Semantics for logic programs without occur check
• Fundamental properties of infinite trees
• The occur-check problem in Prolog
• Relating logic programs and attribute grammars
• The occur-check problem revisited
• Correctness of unification without occur check in prolog
• Logic + control: On program construction and verification
• Verification of logic programs with delay declarations