scientific article; zbMATH DE number 515746

MaRDI QIDQ4283249zbMATH OpenFDO

Authors Robert F. Stärk

Publication date 10 March 1994

zbMATH Keywords

cut-propertyESLDNF-computationslogic programnegation-complete

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Recommendations

• CUT-PROPERTY AND NEGATION AS FAILURE
• A class of programs for which SLDNF resolution and NAF rule are complete
• Proving completeness of logic programs with the cut
• Complete logic programs with domain-closure axiom
• A Complete Axiomatization of the Three valued Completion of Logic Programs

Cited in

(11)

• Negation and constraint logic programming
• A necessary condition for constructive negation in constraint logic programming
• scientific article; zbMATH DE number 3958694 (Why is no real title available?)
• CUT-PROPERTY AND NEGATION AS FAILURE
• Answer Synthesis for CLP Programs with Negation
• scientific article; zbMATH DE number 1456952 (Why is no real title available?)
• scientific article; zbMATH DE number 1453065 (Why is no real title available?)
• A rewrite mechanism for logic programs with negation
• Proving completeness of logic programs with the cut
• Theoretical Aspects of Computing - ICTAC 2004
• Constructive negation and constraint logic programming with sets

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