Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
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.
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Kellen Cheng, Anna Lisa Gentile, et al.
EMNLP 2024
Amy Lin, Sujit Roy, et al.
AGU 2024
P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings