scientific article; zbMATH DE number 4108188

zbMATH Open0676.68052MaRDI QIDQ3832076FDOQ3832076

Authors: Stefano Baratella, Gilberto File 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• A completeness theorem for SLDNF resolution
• On the completed database semantics for negation
• Negation as failure. II
• Completeness of SLDNF-resolution for nonfloundering queries
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption

zbMATH Keywords

negationdeductive databasesSLDNF resolution

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Artificial intelligence (68T99)

Cited In (7)

• A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete
• Acyclic logic programs and the completeness of SLDNF-resolution
• SLT-resolution for the well-founded semantics
• Generalising unit-refutation completeness and SLUR via nested input resolution
• Title not available (Why is that?)
• A completeness theorem for SLDNF resolution
• On the completed database semantics for negation

This page was built for publication:

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