Canonical logic programs

DOI10.1016/0743-1066(86)90020-8zbMath0592.68018OpenAlexW2029753048MaRDI QIDQ3721789

Peter J. Stuckey, Joxan Jaffar

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)

Related Items (8)

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

This page was built for publication: Canonical logic programs