A canonical form for generalized linear constraints

DOI10.1016/0747-7171(92)90002-LzbMath0745.90046OpenAlexW2079522633MaRDI QIDQ1186697

Jean-Louis Lassez, Kenneth McAloon

Publication date: 28 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0747-7171(92)90002-l

zbMATH Keywords

symbolic computationsolvabilityparallelismpolynomial time algorithmselimination of redundancy

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear programming (90C05)

Related Items (20)

Computational complexity and constraint logic programming languages ⋮ Practical issues on the projection of polyhedral sets ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ From LP to LP: Programming with constraints ⋮ From local to global consistency in temporal constraint networks ⋮ Constrained dependencies ⋮ Equality detection for linear arithmetic constraints ⋮ Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs ⋮ Solving linear constraints over real and rational fields ⋮ A method for simultaneous search for refutations and models by equational constraint solving ⋮ On Fourier's algorithm for linear arithmetic constraints ⋮ Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning ⋮ An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints ⋮ A Note on the Inversion Join for Polyhedral Analysis ⋮ Speeding up Polyhedral Analysis by Identifying Common Constraints ⋮ A unifying approach to temporal constraint reasoning ⋮ Data Structures with Arithmetic Constraints: A Non-disjoint Combination ⋮ Querying temporal and spatial constraint networks in PTIME ⋮ Combining topological and size information for spatial reasoning ⋮ Rewriting union queries using views

Uses Software

• GHC

Cites Work

• Redundancy in mathematical programming. A state-of-the-art survey
• Constraint propagation with interval labels
• Network-based heuristics for constraint-satisfaction problems
• Linear programming is log-space hard for P
• Nonequilibrium phase transitions in epidemics and sandpiles
• Truly concurrent constraint programming
• On the SUP-INF Method for Proving Presburger Formulas
• Equivalent Integer Programs and Canonical Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A canonical form for generalized linear constraints