The occur-check problem in Prolog

DOI10.1007/BF03037324MaRDI QIDQ1077912zbMATH OpenFDO

Authors David A. Plaisted

Publication date 1984

Published in New Generation Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF03037324

zbMATH Keywords

first-order predicate calculuslogic programmingoccur checkoperatinal semanticsProlog programsunification

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• The occur-check problem revisited
• scientific article; zbMATH DE number 42100
• Detecting Determinacy in Prolog Programs
• Correctness of unification without occur check in prolog
• scientific article; zbMATH DE number 4182856
• scientific article; zbMATH DE number 868104
• Proof checking and logic programming
• Proof checking and logic programming

Cites work

• A Machine-Oriented Logic Based on the Resolution Principle
• scientific article; zbMATH DE number 3731310 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)

Cited in

(12)

• Automatic inductive theorem proving using Prolog
• C-expressions: A variable-free calculus for equational logic programming
• Set-sharing is redundant for pair-sharing
• The occur-check problem revisited
• scientific article; zbMATH DE number 4060686 (Why is no real title available?)
• Correctness of unification without occur check in prolog
• A relaxed condition for avoiding the occur-check
• Partheo: A high-performance parallel theorem prover
• A note on occur-check
• Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
• Compiling a default reasoning system into Prolog
• Semantics for logic programs without occur check

This page was built for publication: The occur-check problem in Prolog

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