This may seem silly, but I am curious about algorithms used to computationally assert the truthiness (true, false, or unknown) of symbolic statements subject to a set of inequality constraints, for instance \begin{align*} \text{Constraints}: \\ a &< b \\ b &=c \\ c &= d \\ d &< e \\ \text{Assert whether}: \\ a &< e \\ \text{Returns}: \\ &\text{true} \end{align*}
I can't help but think that there exist computational algorithms to solve such systems, but I can't find any info on them because I cannot accurately describe such a problem in mathematical terms.