at.logic.skeptik.algorithm.compressor.combinedRPILU
Eval : compute information about CutIC nodes
Eval : compute information about CutIC nodes
Choice : choose between lowering and regularization
Choice : choose between lowering and regularization
Collector : compute information about each node (using Eval)
Collector : compute information about each node (using Eval)
(quadraticCollector: (Proof[SequentProofNode], Guard[SequentProofNode]) ⇒ Proof[SequentProofNode]).apply(v1, v2)
(quadraticCollector: (Proof[SequentProofNode]) ⇒ Proof[SequentProofNode]).apply(v1)
(quadraticCollector: StringAdd).self
(quadraticCollector: StringFormat).self
(quadraticCollector: (Proof[SequentProofNode], Guard[SequentProofNode]) ⇒ Proof[SequentProofNode]).toString()
(quadraticCollector: (Proof[SequentProofNode]) ⇒ Proof[SequentProofNode]).toString()
(quadraticCollector: ArrowAssoc[QuadraticCollector]).x
(Since version 2.10.0) Use leftOfArrow
instead
(quadraticCollector: Ensuring[QuadraticCollector]).x
(Since version 2.10.0) Use resultOfEnsuring
instead
Assumes probability that other children will have same safe literals = 1 / square of the number of children. Slow and less efficient than DiscreteCollector.