scientific article; zbMATH DE number 3958704

MaRDI QIDQ3727360zbMATH OpenFDO

Authors Roberto Barbuti, M. Martelli

Publication date 1986

zbMATH Keywords

completenesslogic programsrecursive definitionsSLDNF-resolution

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A Completeness Result for SLDNF-Resolution
• On the completeness of SLDENF-resolution
• A completeness theorem for SLDNF resolution
• Acyclic logic programs and the completeness of SLDNF-resolution
• A class of programs for which SLDNF resolution and NAF rule are complete

Cited in

(17)

• Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
• Acyclic logic programs and the completeness of SLDNF-resolution
• Completions of perpetual logic programs
• Paraconsistent logic programming
• Stratified least fixpoint logic
• SLT-resolution for the well-founded semantics
• Generalising unit-refutation completeness and SLUR via nested input resolution
• The completeness of SLDNF-resolution with respect to modal completion
• A completeness theorem for SLDNF resolution
• scientific article; zbMATH DE number 4191092 (Why is no real title available?)
• scientific article; zbMATH DE number 4160165 (Why is no real title available?)
• scientific article; zbMATH DE number 3949749 (Why is no real title available?)
• scientific article; zbMATH DE number 516997 (Why is no real title available?)
• A Completeness Result for SLDNF-Resolution
• A class of programs for which SLDNF resolution and NAF rule are complete
• Strict completion of logic programs
• Protected completions of first-order general logic programs

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