scientific article; zbMATH DE number 4176422

MaRDI QIDQ3200532zbMATHFDO

Authors Stefano Baratella

Publication date 1991

zbMATH Keywords

consistencyClark's completioncompletion of a semi-strict program

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Tight, consistent, and computable completions for unrestricted logic programs
• SLDNF-resolution with equality
• Completed logic programs and their consistency
• Graph properties for normal logic programs
• On the strong completion of logic programs

Cited in

(6)

• Graph properties for normal logic programs
• scientific article; zbMATH DE number 4123705 (Why is no real title available?)
• Lloyd-Topor completion and general stable models
• A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete
• Completed logic programs and their consistency
• Decidability of the Clark's completion semantics for monadic programs and queries

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