Canonical logic programs

DOI10.1016/0743-1066(86)90020-8zbMATH Open0592.68018OpenAlexW2029753048MaRDI QIDQ3721789FDOQ3721789

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

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

zbMATH Keywords

greatest fixpointfinite failure setcanonical logic programs

Mathematics Subject Classification ID

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

Cited In (9)

• Paraconsistent logic programming
• Left termination turned into termination
• Title not available (Why is that?)
• Eliminating negation from normal logic programs
• Between constructive mathematics and PROLOG
• Transforming normal logic programs to constraint logic programs
• The query topology in logic programming
• Protected completions of first-order general logic programs
• Definite clause programs are canonical (over a suitable domain)

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)