Termination of logic programs with delay declarations

DOI10.1016/S0743-1066(98)10034-1MaRDI QIDQ4700387zbMATH OpenOpenAlexFDO

Authors Elena Marchiori, Frank Teusink

Publication date 1 November 1999

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

Full work available at URL https://doi.org/10.1016/s0743-1066(98)10034-1

zbMATH Keywords

delay recurrent programsrecurrent logic program

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Logic Programming
• Classes of terminating logic programs
• Verification of logic programs with delay declarations
• Verifying termination and error-freedom of logic programs with block declarations
• Transformational methodology for proving termination of logic programs

Cited in

(6)

• Verifying termination and error-freedom of logic programs with block declarations
• Proving correctness of constraint logic programs with dynamic scheduling
• Operational semantics for reexecution-based analysis of logic programs with delay declarations
• Termination of simply moded logic programs with dynamic scheduling
• scientific article; zbMATH DE number 2084360 (Why is no real title available?)
• Verification of logic programs with delay declarations

This page was built for publication: Termination of logic programs with delay declarations

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