A note on SLDNF-resolution

DOI10.1093/LOGCOM/8.2.159MaRDI QIDQ4399716zbMATH OpenOpenAlexFDO

Authors Wilfried Buchholz

Publication date 28 July 1998

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/8.2.159

zbMATH Keywords

SLDNF-resolutionSLDNF-tree

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A direct proof of the completeness of SLDNF-resolution
• A completeness theorem for SLDNF resolution
• Completeness of SLDNF-resolution for nonfloundering queries
• A new definition of SLDNF-resolution

Cited in

(5)

• A framework for computing finite SLD trees
• Completeness of SLDNF-resolution for nonfloundering queries
• A direct proof of the completeness of SLDNF-resolution
• A new definition of SLDNF-resolution
• Levationis Laus

This page was built for publication: A note on SLDNF-resolution

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