The role of standardising apart in logic programming

DOI10.1016/0304-3975(94)90084-1zbMATH Open0811.68068OpenAlexW2148649496MaRDI QIDQ1329744FDOQ1329744

John 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Partial evaluation in logic programming
• Negation in logic programming
• A sound and complete semantics for a version of negation as failure
• Generalizing completeness results for loop checks in logic programming
• A Complete Axiomatization of the Three valued Completion of Logic Programs

Cited In (2)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Unifying theories for logic programming 👍 👎
• The expressive powers of the logic programming semantics 👍 👎
• A uniform approach to logic programming semantics 👍 👎
• KI 2003: Advances in Artificial Intelligence 👍 👎
• The relation between logic programming and logic specification 👍 👎
• Defining standard Prolog in rewriting logic 👍 👎
• Justifications for Logic Programming 👍 👎

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

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