at.logic.skeptik.algorithm.compressor.combinedRPILU
Collector : compute information about each node (using Eval)
Collector : compute information about each node (using Eval)
Choice : choose between lowering and regularization
Choice : choose between lowering and regularization
Eval : compute information about CutIC nodes
Eval : compute information about CutIC nodes
(minEval: (Proof[SequentProofNode], Guard[SequentProofNode]) ⇒ Proof[SequentProofNode]).apply(v1, v2)
(minEval: (Proof[SequentProofNode]) ⇒ Proof[SequentProofNode]).apply(v1)
(minEval: StringAdd).self
(minEval: StringFormat).self
(minEval: (Proof[SequentProofNode], Guard[SequentProofNode]) ⇒ Proof[SequentProofNode]).toString()
(minEval: (Proof[SequentProofNode]) ⇒ Proof[SequentProofNode]).toString()
(minEval: ArrowAssoc[MinEval]).x
(Since version 2.10.0) Use leftOfArrow
instead
(minEval: Ensuring[MinEval]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
Assumes only the worst (non-null) regularization will happen.