Semantics for logic programs without occur check

DOI10.1016/0304-3975(90)90194-MzbMath0699.68114WikidataQ56455083 ScholiaQ56455083MaRDI QIDQ913532

W. P. Weijland

Publication date: 1990

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

zbMATH Keywords

completenessPrologsoundnessnegation as failureoccur checkcircular bindings of variablesCSLD-resolution

Mathematics Subject Classification ID

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

Related Items (1)

A relaxed condition for avoiding the occur-check

Cites Work

• Unnamed Item
• Fundamental properties of infinite trees
• The occur-check problem in Prolog
• Semantics of infinite tree logic programming
• Contributions to the semantics of logic perpetual processes
• A logical reconstruction of Prolog II
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language

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