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

DOI10.1007/978-3-540-69166-2_9MaRDI QIDQ3522065zbMATH OpenOpenAlexFDO

Authors 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

constraint logic programmingdefinitenesslinear constraintspolyhedrawell-moding

Mathematics Subject Classification ID

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

Recommendations

• Typing constraint logic programs
• scientific article; zbMATH DE number 1420825
• Checking modes of HAL programs
• A type system for logic programs
• scientific article; zbMATH DE number 1696868

Cites work

• A canonical form for generalized linear constraints
• Abstracting numeric constraints with Boolean functions
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• scientific article; zbMATH DE number 3825556 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 35420 (Why is no real title available?)
• scientific article; zbMATH DE number 2085274 (Why is no real title available?)

Cited in

(6)

• On quantified linear implications
• scientific article; zbMATH DE number 1696868 (Why is no real title available?)
• A complexity perspective on entailment of parameterized linear constraints
• scientific article; zbMATH DE number 1420825 (Why is no real title available?)
• Checking modes of HAL programs
• Type-based homeomorphic embedding for online termination

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

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