InEqConj
Related Docs:
object InEqConj
| package inequalities
All stored or inferred inequalities.
All inferred inequalities, including both Fourier-Motzkin inferences and bounds derived using interval constraint propagation.
Find all inequalities starting with a given ConstantTerm or
VariableTerm.
Find all inequalities starting with a given ConstantTerm or
VariableTerm. Optionally, the search can also include
inferred inequalities.
Determine whether a lower bound can be inferred from this
conjunction of inequalities for the given linear combination.
Determine whether a lower bound can be inferred from this
conjunction of inequalities for the given linear combination.
The only allowed case of obviously unsatisfiable systems of inequalities is
the one of a single inequality -1 >= 0
Cheap check whether this system of inequalities is satisfiable over integers
Check whether this system of inequalities has rational solutions
Return true if this formula is obviously always true
Create the negation of at most one equation
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
Re-sort an object with a new TermOrder.
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
Update the inequalities of this conjunction; if nothing has changed, inferences are not recomputed
Update the inequalities of this conjunction; if nothing has changed, inferences are not recomputed
Update the inequalities of this conjunction, assuming that the new inequalities for a subset of the old ones.
Update the inequalities of this conjunction, assuming that the new inequalities for a subset of the old ones. If nothing has changed, inferences are not recomputed.
Currently, we do not use the subset information in the best possible way
(Since version ) see corresponding Javadoc for more information.
Class for storing a conjunction of inequalities that are normalised to the form
t >= 0. Together with the actual inequalities, also all inequalities that can be inferred using Fourier-Motzkin elimination steps, as well as all equations that can be inferred using Fourier-Motzkin are stored. This implies that it can always be decided in constant time whether the inequalities have rational solutions.