Standard forms for rational linear arithmetic in constraint logic programming.

DOI10.1007/BF01543480zbMath1034.68508MaRDI QIDQ1354046

Thomas Graf, Pascal Van Hentenryck

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

constraint logic programming languages

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (4)

Standard forms for rational linear arithmetic in constraint logic programming. ⋮ Redundancy elimination with a lexicographic solved form ⋮ New techniques for linear arithmetic: cubes and equalities ⋮ Constraint satisfaction using constraint logic programming

Uses Software

• CHIP

Cites Work

• Standard forms for rational linear arithmetic in constraint logic programming.
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• New Finite Pivoting Rules for the Simplex Method
• Unnamed Item
• Unnamed Item

This page was built for publication: Standard forms for rational linear arithmetic in constraint logic programming.