Semantics for logic programs without occur check

DOI10.1016/0304-3975(90)90194-MzbMATH Open0699.68114WikidataQ56455083 ScholiaQ56455083MaRDI QIDQ913532FDOQ913532

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)

Cites Work

• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• Fundamental properties of infinite trees
• Contributions to the Theory of Logic Programming
• Contributions to the semantics of logic perpetual processes
• The occur-check problem in Prolog
• A logical reconstruction of Prolog II
• Semantics of infinite tree logic programming

Cited In (3)

• Non-Horn clause logic programming without contrapositives
• Correctness of unification without occur check in prolog
• A relaxed condition for avoiding the 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)