Canonical logic programs

DOI10.1016/0743-1066(86)90020-8zbMATHOpenAlexMaRDI QIDQ3721789FDO

Authors Joxan Jaffar, Peter J. Stuckey

Publication date 1986

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

Full work available at URL https://doi.org/10.1016/0743-1066(86)90020-8

zbMATH Keywords

greatest fixpointfinite failure setcanonical logic programs

Mathematics Subject Classification ID

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

Recommendations

• A computable semantics for general logic programs
• A kripke-kleene semantics for logic programs*
• Negation-as-failure rule for general logic programs with equality
• Graph properties for normal logic programs
• The well-founded semantics for general logic programs

Cited in

(9)

• The query topology in logic programming
• Transforming normal logic programs to constraint logic programs
• Protected completions of first-order general logic programs
• Paraconsistent logic programming
• Definite clause programs are canonical (over a suitable domain)
• scientific article; zbMATH DE number 218508 (Why is no real title available?)
• Between constructive mathematics and PROLOG
• Left termination turned into termination
• Eliminating negation from normal logic programs

This page was built for publication: Canonical logic programs

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