at.logic.skeptik.algorithm.compressor

combinedRPILU

package combinedRPILU

Content Hierarchy Learn more about scaladoc diagrams
IdempotentThreePassLowerUnitsThreePassLowerUnitsAbstractThreePassLowerLowerUnivalentsBeforeRecyclePivotsIdempotentRegularizationEvaluationQuadraticHeuristicIdempotentRegularizationEvaluationRegularizeIfPossibleIdempotentRegularizationEvaluationLoweringChoiceIdempotentRegularizationInformationRegularizationChoiceMinRegularizationChoiceMinLoweringChoiceMinRegularizationEvaluationRegularizeIfPossibleMinEvalAddEvalQuadraticCollectorDiscreteCollectorRegularizationEvaluationIdempotentLowerUnivalentsBeforeRecyclePivotsLowerUnivalentsBeforeRecyclePivotsIdempotentLowerUnivalentsAfterRecyclePivotsOptLowerUnivalentsAfterRecyclePivotsWithOptIdempotentLowerUnivalentsAfterRecyclePivotsLowerUnivalentsAfterRecyclePivotsLowerUnivalentsAfterRecyclePivotsLowerUnivalentsOptLowerUnivalentsOptCollectUnivalentsDuringFixingWithOptLowerUnivalentsLowerUnivalentsCollectUnivalentsDuringFixingIdempotentIrregularUnitsRegularizeIdempotentIrregularUnitsLowerAlwaysRegularizeIrregularUnitsAlwaysLowerIrregularUnitsIrregularUnits
Visibility
  1. Public
  2. All

Type Members

  1. abstract class AbstractThreePassLower extends AbstractRPIAlgorithm with UnitsCollectingBeforeFixing with Intersection

  2. trait AddEval extends RegularizationEvaluation

    Assumes all the possible regularizations will happen.

  3. trait AlwaysLowerIrregularUnits extends IrregularUnits

  4. trait AlwaysRegularizeIrregularUnits extends IrregularUnits

  5. trait CollectUnivalentsDuringFixing extends AbstractRPILUAlgorithm

  6. trait CollectUnivalentsDuringFixingWithOpt extends AbstractRPILUAlgorithm

  7. trait DiscreteCollector extends RegularizationEvaluation

    Assumes a derivation with more than one child won't be regularized (probability that other children will have same safe literals = 0).

  8. abstract class IrregularUnits extends AbstractRPIAlgorithm with UnitsCollectingBeforeFixing with Intersection

  9. abstract class LowerUnivalents extends AbstractRPILUAlgorithm with CollectUnivalentsDuringFixing with IdempotentAlgorithm[SequentProofNode]

  10. abstract class LowerUnivalentsAfterRecyclePivots extends AbstractRPIAlgorithm with CollectEdgesUsingSafeLiterals with CollectUnivalentsDuringFixing with Intersection

  11. abstract class LowerUnivalentsAfterRecyclePivotsWithOpt extends AbstractRPIAlgorithm with CollectEdgesUsingSafeLiterals with CollectUnivalentsDuringFixingWithOpt with Intersection

  12. abstract class LowerUnivalentsBeforeRecyclePivots extends AbstractThreePassLower

  13. abstract class LowerUnivalentsOpt extends AbstractRPILUAlgorithm with CollectUnivalentsDuringFixingWithOpt with IdempotentAlgorithm[SequentProofNode]

  14. trait MinEval extends RegularizationEvaluation

    Assumes only the worst (non-null) regularization will happen.

  15. trait MinLoweringChoice extends RegularizationEvaluation with MinRegularizationEvaluation

    Choose to lower in case of equality.

  16. trait MinRegularizationChoice extends RegularizationEvaluation with MinRegularizationEvaluation

    Choose to regularize in case of equality.

  17. trait MinRegularizationEvaluation extends RegularizationEvaluation

    Assumes that only the worst (non-null) regularization of each direct premise will happen.

  18. trait QuadraticCollector extends RegularizationEvaluation

    Assumes probability that other children will have same safe literals = 1 / square of the number of children.

  19. abstract class RegularizationEvaluation extends AbstractRPIAlgorithm with UnitsCollectingBeforeFixing with Intersection

  20. class RegularizationInformation extends AnyRef

  21. trait RegularizeIfPossible extends RegularizationEvaluation

    Don't lower any unit that can be regularized or whose (direct or indirect) premises can be.

  22. abstract class ThreePassLowerUnits extends AbstractThreePassLower

Value Members

  1. object IdempotentIrregularUnitsLower extends IrregularUnits with AlwaysLowerIrregularUnits with IdempotentAlgorithm[SequentProofNode]

  2. object IdempotentIrregularUnitsRegularize extends IrregularUnits with AlwaysRegularizeIrregularUnits with IdempotentAlgorithm[SequentProofNode]

  3. object IdempotentLowerUnivalentsAfterRecyclePivots extends LowerUnivalentsAfterRecyclePivots with IdempotentAlgorithm[SequentProofNode]

  4. object IdempotentLowerUnivalentsAfterRecyclePivotsOpt extends LowerUnivalentsAfterRecyclePivotsWithOpt with IdempotentAlgorithm[SequentProofNode]

  5. object IdempotentLowerUnivalentsBeforeRecyclePivots extends LowerUnivalentsBeforeRecyclePivots with IdempotentAlgorithm[SequentProofNode]

  6. object IdempotentRegularizationEvaluationLoweringChoice extends RegularizationEvaluation with DiscreteCollector with MinEval with MinLoweringChoice with IdempotentAlgorithm[SequentProofNode]

  7. object IdempotentRegularizationEvaluationQuadraticHeuristic extends RegularizationEvaluation with QuadraticCollector with MinEval with MinLoweringChoice with IdempotentAlgorithm[SequentProofNode]

  8. object IdempotentRegularizationEvaluationRegularizeIfPossible extends RegularizationEvaluation with QuadraticCollector with AddEval with RegularizeIfPossible with IdempotentAlgorithm[SequentProofNode]

  9. object IdempotentRegularizationInformationRegularizationChoice extends RegularizationEvaluation with DiscreteCollector with MinEval with MinRegularizationChoice with IdempotentAlgorithm[SequentProofNode]

  10. object IdempotentThreePassLowerUnits extends ThreePassLowerUnits with IdempotentAlgorithm[SequentProofNode]

  11. object LowerUnivalents extends LowerUnivalents

  12. object LowerUnivalentsAfterRecyclePivots extends LowerUnivalentsAfterRecyclePivots with RepeatableWhileCompressingAlgorithm[SequentProofNode]

  13. object LowerUnivalentsBeforeRecyclePivots extends LowerUnivalentsBeforeRecyclePivots with RepeatableWhileCompressingAlgorithm[SequentProofNode]

  14. object LowerUnivalentsOpt extends LowerUnivalentsOpt

  15. object RegularizationInformation

  16. package lowerableUnivalent

Ungrouped