Strong termination of logic programs

DOI10.1016/0743-1066(93)90014-8MaRDI QIDQ4036282zbMATH OpenOpenAlexFDO

Authors Marc Bezem

Publication date 16 May 1993

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

Full work available at URL https://dspace.library.uu.nl/handle/1874/26249

zbMATH Keywords

terminationProlog programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Termination proofs for logic programs
• A methodology for proving termination of logic programs
• On the strong completion of logic programs
• scientific article; zbMATH DE number 176506
• Termination of constraint logic programs
• scientific article; zbMATH DE number 1149425
• Input-Termination of Logic Programs
• Program Development in Computational Logic
• scientific article; zbMATH DE number 1696776

Cited in

(26)

• Fast offline partial evaluation of logic programs
• Fast and accurate strong termination analysis with an application to partial evaluation
• Negation as failure for disjunctive logic programming
• On the existence of nonterminating queries for a restricted class of PROLOG-clauses
• On Correctness and Completeness of an n Queens Program
• Undecidable goals for completed acyclic programs
• Termination of logic programs: the never-ending story
• Termination of grounding is not preserved by strongly equivalent transformations
• Termination of constraint logic programs
• On termination of functional symbol-free logic programs
• Loop checking in SLD-derivations by well-quasi-ordering of goals
• \(\exists\)-Universal termination of logic programs
• Totally correct logic program transformations via well-founded annotations
• Automated modular termination proofs for real Prolog programs
• scientific article; zbMATH DE number 4191092 (Why is no real title available?)
• On completeness of logic programs
• Logic + control: on program construction and verification
• scientific article; zbMATH DE number 6606377 (Why is no real title available?)
• Program Development in Computational Logic
• Terminating evaluation of logic programs with finite three-valued models
• Proving completeness of logic programs with the cut
• Left termination turned into termination
• Correctness and completeness of logic programs
• A logical semantics for depth-first Prolog with ground negation
• Input-Termination of Logic Programs
• Classes of terminating logic programs

This page was built for publication: Strong termination of logic programs

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