Correct answers to allowed programs and queries are ground

DOI10.1016/0743-1066(91)90032-KzbMATH Open0764.68156MaRDI QIDQ3988802FDOQ3988802

Authors: John Shepherdson 

Publication date: 28 June 1992

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Recommendations

• The well-founded semantics for general logic programs
• Generic models of logic programs
• scientific article; zbMATH DE number 4199653
• Proof method of partial correctness and weak completeness for normal logic programs
• A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses

zbMATH Keywords

allowed programsSLDNF resolution

Mathematics Subject Classification ID

Cited In (3)

• Acyclic logic programs and the completeness of SLDNF-resolution
• Title not available (Why is that?)
• A functorial framework for constraint normal logic programming

This page was built for publication: Correct answers to allowed programs and queries are ground

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