Termination of constraint logic programs

DOI10.1007/3-540-63165-8_236zbMATH Open1401.68028OpenAlexW1613058221MaRDI QIDQ4572011FDOQ4572011

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Termination of logic programs: the never-ending story
• On termination of general logic programs w.R.T. constructive negation

Cited In (13)

• Title not available (Why is that?)
• Specifying termination in CSP
• Recurrence with affine level mappings is P-time decidable for CLP
• On Termination of Binary CLP Programs
• Termination of floating-point computations
• \(\exists\)-Universal termination of logic programs
• Static Analysis
• Termination of simply moded logic programs with dynamic scheduling
• Strong termination of logic programs
• Termination of logic programs: the never-ending story
• cTI: a constraint-based termination inference tool for ISO-Prolog
• Proving Termination by Invariance Relations
• Input-Termination of Logic Programs

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)