Termination of constraint logic programs

DOI10.1007/3-540-63165-8_236MaRDI QIDQ4572011zbMATH OpenOpenAlexFDO

Authors Salvatore Ruggieri

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63165-8_236

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1223557
• On proving left termination of constraint logic programs
• Termination proofs for logic programs
• Strong termination of logic programs
• Input-Termination of Logic Programs
• Static Analysis
• Program Development in Computational Logic
• Using linear constraints for logic program termination analysis
• scientific article; zbMATH DE number 1948416
• Logic Programming

Cites work

• scientific article; zbMATH DE number 870438 (Why is no real title available?)
• On termination of general logic programs w.R.T. constructive negation
• Termination of logic programs: the never-ending story

Cited in

(17)

• Strong termination of logic programs
• Specifying termination in CSP
• scientific article; zbMATH DE number 1223557 (Why is no real title available?)
• CLP(χ) for automatically proving program properties1An earlier version of this paper was presented at the workshop “Frontiers of Combining Systems”, Munich, March 1996.1
• Termination of logic programs: the never-ending story
• scientific article; zbMATH DE number 1140685 (Why is no real title available?)
• scientific article; zbMATH DE number 1948416 (Why is no real title available?)
• cTI: a constraint-based termination inference tool for ISO-Prolog
• On proving left termination of constraint logic programs
• Termination of simply moded logic programs with dynamic scheduling
• Proving Termination by Invariance Relations
• Recurrence with affine level mappings is P-time decidable for CLP
• Input-Termination of Logic Programs
• On Termination of Binary CLP Programs
• Static Analysis
• -Universal termination of logic programs
• Termination of floating-point computations

This page was built for publication: Termination of constraint logic programs

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