scientific article; zbMATH DE number 4176422

zbMATH Open0714.68009MaRDI QIDQ3200532FDOQ3200532

Authors: Stefano Baratella 

Publication date: 1991

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

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

zbMATH Keywords

consistencyClark's completioncompletion of a semi-strict program

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (6)

• A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete
• Lloyd-Topor completion and general stable models
• Graph properties for normal logic programs
• Title not available (Why is that?)
• 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)