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