Publication
Journal of Automated Reasoning
Paper

On Fourier's algorithm for linear arithmetic constraints

View publication

Abstract

In the 1820s Fourier provided the first algorithm for solving linear arithmetic constraints. In other words, this algorithm determines whether or not the polyhedral set associated with the constraints is empty. We show here that Fourier's algorithm has an important hidden property: in effect it also computes the affine hull of the polyhedral set. This result is established by making use of a recent theorem on the independence of negative constraints. © 1992 Kluwer Academic Publishers.

Date

01 Dec 1992

Publication

Journal of Automated Reasoning

Authors

Topics

Share