# ReduceWithAC

### Related Docs: object ReduceWithAC | package arithconj

#### class ReduceWithAC extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. ReduceWithAC
2. AnyRef
3. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Value Members

1. #### final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
2. #### final def ##(): Int

Definition Classes
AnyRef → Any
3. #### final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any

7. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
8. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
9. #### final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
10. #### def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
11. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
12. #### final def getClass(): Class[_]

Definition Classes
AnyRef → Any
13. #### def hashCode(): Int

Definition Classes
AnyRef → Any
14. #### final def isInstanceOf[T0]: Boolean

Definition Classes
Any
15. #### def lowerBound(t: Term): Option[IdealInt]

Check whether known inequalities imply a lower bound of the given term.

16. #### def lowerBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

Check whether the known inequalities imply a lower bound of the given term.

Check whether the known inequalities imply a lower bound of the given term. Also return assumed inequalities needed to derive the bound.

17. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
18. #### final def notify(): Unit

Definition Classes
AnyRef
19. #### final def notifyAll(): Unit

Definition Classes
AnyRef

21. #### def plainReduce(conj: ArithConj): (ArithConj, ReduceWithAC)

Just reduce the components of the conjunction individually, do not do any internal propagation.

22. #### def reduceAndAdd(conj: ArithConj, logger: ComputationLogger): (ArithConj, ReduceWithAC)

Reduce an arithmetic conjunction using the information stored in this object.

Reduce an arithmetic conjunction using the information stored in this object. The result is the simplified conjunction, as well as a new reducer to which the information from the simplified arithmetic conjunction has been added.

23. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
24. #### def toString(): String

Definition Classes
AnyRef → Any
25. #### def upperBound(t: Term): Option[IdealInt]

Check whether known inequalities imply an upper bound of the given term.

26. #### def upperBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

Check whether the known inequalities imply an upper bound of the given term.

Check whether the known inequalities imply an upper bound of the given term. Also return assumed inequalities needed to derive the bound.

27. #### final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
28. #### final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
29. #### final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )