Negation-as-failure rule for general logic programs with equality

DOI10.1016/S0743-1066(85)80004-2MaRDI QIDQ3727350zbMATH OpenOpenAlexFDO

Authors Van Tu le

Publication date 1985

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(85)80004-2

zbMATH Keywords

Clark completionderivation sequencefailure setfixed point semanticslogic programmingnon-recursive ordinalsuccess set

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) General topics in the theory of software (68N01)

Recommendations

• A theory of complete logic programs with equality
• General failure of logic programs
• Negation as failure using tight derivations for general logic programs
• SLDNF-resolution with equality
• Complete extension of general logic programs

Cited in

(13)

• Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
• SLDNF-resolution with equality
• Complete extension of general logic programs
• scientific article; zbMATH DE number 4199654 (Why is no real title available?)
• A theory of complete logic programs with equality
• Canonical logic programs
• Comments on “general failure of logic programs”
• Negation as failure using tight derivations for general logic programs
• scientific article; zbMATH DE number 18533 (Why is no real title available?)
• Success and failure for hereditary Harrop formulae
• scientific article; zbMATH DE number 1984523 (Why is no real title available?)
• First order compiler: A deterministic logic program synthesis algorithm
• Protected completions of first-order general logic programs

This page was built for publication: Negation-as-failure rule for general logic programs with equality

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