Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs

DOI10.1007/978-3-540-69166-2_9zbMath1149.68365OpenAlexW81447482MaRDI QIDQ3522065

Fred Mesnard, Salvatore Ruggieri

Publication date: 28 August 2008

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69166-2_9

zbMATH Keywords

polyhedralinear constraintsconstraint logic programmingdefinitenesswell-moding

Mathematics Subject Classification ID

Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

A complexity perspective on entailment of parameterized linear constraints ⋮ On quantified linear implications ⋮ Type-based homeomorphic embedding for online termination

Cites Work

• Abstracting numeric constraints with Boolean functions
• A canonical form for generalized linear constraints
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs