On termination of general logic programs w.R.T. constructive negation

DOI10.1016/0743-1066(95)00090-9MaRDI QIDQ3128617zbMATH OpenOpenAlexFDO

Authors Elena Marchiori

Publication date 28 May 1997

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

Full work available at URL https://ir.cwi.nl/pub/2221

zbMATH Keywords

constructive negationsyntactic characterization of general logic programstermination

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1149425
• Program Development in Computational Logic
• A dynamic approach to characterizing termination of general logic programs
• Proving termination of general Prolog programs
• Negation as failure using tight derivations for general logic programs

Cited in

(4)

• Loop checking in SLD-derivations by well-quasi-ordering of goals
• scientific article; zbMATH DE number 5307783 (Why is no real title available?)
• Négation constructive et axiomatique interne
• Termination of constraint logic programs

This page was built for publication: On termination of general logic programs w.R.T. constructive negation

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