Chandru, V (1993) Variable Elimination in Linear Constraints. In: Computer Journal, The, 36 (5). pp. 463-472.
Variable.pdf - Published Version
Restricted to Registered users only
Download (5Mb) | Request a copy
Gauss and Fourier have together provided us with the essential techniques for symbolic computation with linear arithmetic constraints over the reals and the rationals. These variable elimination techniques for linear constraints have particular significance in the context of constraint logic programming languages that have been developed in recent years. Variable elimination in linear equations (Guassian Elimination) is a fundamental technique in computational linear algebra and is therefore quite familiar to most of us. Elimination in linear inequalities (Fourier Elimination), on the other hand, is intimately related to polyhedral theory and aspects of linear programming that are not quite as familiar. In addition, the high complexity of elimination in inequalities has forces the consideration of intricate specializations of Fourier's original method. The intent of this survey article is to acquaint the reader with these connections and developments. The latter part of the article dwells on the thesis that variable elimination in linear constraints over the reals extends quite naturally to constraints in certain discrete domains.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Oxford University Press.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||26 Apr 2011 10:20|
|Last Modified:||10 Jun 2011 07:36|
Actions (login required)