Semantics for logic programs without occur check

DOI10.1016/0304-3975(90)90194-MMaRDI QIDQ913532zbMATH OpenWikidataFDO

Authors W. P. Weijland

Publication date 1990

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

zbMATH Keywords

completenessnegation as failuresoundnessPrologoccur checkcircular bindings of variablesCSLD-resolution

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 4060686
• The occur-check problem in Prolog
• Correctness of unification without occur check in prolog
• The occur-check problem revisited
• scientific article; zbMATH DE number 4076677

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• A logical reconstruction of Prolog II
• Contributions to the Theory of Logic Programming
• Contributions to the semantics of logic perpetual processes
• Fundamental properties of infinite trees
• Semantics of infinite tree logic programming
• The Semantics of Predicate Logic as a Programming Language
• The occur-check problem in Prolog

Cited in

(6)

• scientific article; zbMATH DE number 4060686 (Why is no real title available?)
• Non-Horn clause logic programming without contrapositives
• The occur-check problem revisited
• Correctness of unification without occur check in prolog
• A relaxed condition for avoiding the occur-check
• A note on occur-check

This page was built for publication: Semantics for logic programs without occur check

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