The role of standardising apart in logic programming

DOI10.1016/0304-3975(94)90084-1zbMath0811.68068OpenAlexW2148649496MaRDI QIDQ1329744

John C. Shepherdson

Publication date: 1 May 1995

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90084-1

zbMATH Keywords

completeness theoremlogic programminglifting lemmamgu lemma

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

First-order theories for pure Prolog programs with negation ⋮ Optimality in goal-dependent analysis of Sharing

Cites Work

• Generalizing completeness results for loop checks in logic programming
• A sound and complete semantics for a version of negation as failure
• Negation in logic programming
• A Complete Axiomatization of the Three valued Completion of Logic Programs
• Partial evaluation in logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The role of standardising apart in logic programming