Package

at.logic.gapt.proofs

reduction

Permalink

package reduction

Content Hierarchy
Visibility
  1. Public
  2. All

Type Members

  1. case class CombinedReduction[-P1, P2, +P3, +S1, S2, -S3](red1: Reduction[P1, P2, S1, S2], red2: Reduction[P2, P3, S2, S3]) extends Reduction[P1, P3, S1, S3] with Product with Serializable

    Permalink

    Sequential composition of reductions.

    Sequential composition of reductions.

    This class is not intended to be used directly, but via the Reduction#|> operator.

  2. trait OneWayReduction_[P] extends Reduction[P, P, Nothing, Any]

    Permalink

    A reduction without back-translation.

  3. trait Reduction[-P1, +P2, +S1, -S2] extends AnyRef

    Permalink

    Represents a reduction of a problem together with a back-translation of the solutions.

    Represents a reduction of a problem together with a back-translation of the solutions.

    A problem P1 is reduced to a problem P2, a solution S2 to the problem P2 can then be translated back to a solution S1 of the problem P1.

  4. trait Reduction_[P, S] extends Reduction[P, P, S, S]

    Permalink

    A reduction that does not change the type of the problem.

Value Members

  1. object CNFReductionExpRes extends Reduction[HOLSequent, Set[HOLClause], ExpansionProof, ResolutionProof] with Product with Serializable

    Permalink

    Reduces finding an expansion proof for a sequent to finding a resolution proof of a clause set.

  2. object CNFReductionLKRes extends Reduction[HOLSequent, Set[HOLClause], LKProof, ResolutionProof] with Product with Serializable

    Permalink

    Reduces finding an LK proof for a sequent to finding a resolution proof of a clause set.

  3. object ErasureReductionCNF extends Reduction_[Set[HOLClause], ResolutionProof] with Product with Serializable

    Permalink

    Reduces finding a resolution proof of a many-sorted clause set to the first-order case.

    Reduces finding a resolution proof of a many-sorted clause set to the first-order case.

    Sorts are simply ignored and we make a best effort to convert the resolution refutation back.

  4. object ErasureReductionET extends Reduction_[HOLSequent, ExpansionProof] with Product with Serializable

    Permalink

    Reduces finding an expansion proof of a many-sorted sequent to the first-order case.

    Reduces finding an expansion proof of a many-sorted sequent to the first-order case.

    Sorts are simply ignored and we make a best effort to convert the expansion tree.

  5. object GroundingReductionET extends Reduction_[HOLSequent, ExpansionProof] with Product with Serializable

    Permalink

    Simplifies the problem by grounding free variables.

  6. object HOFunctionReduction extends OneWayReduction_[HOLSequent] with Product with Serializable

    Permalink

    Replaces the use of higher-order functions by fresh function symbols, together with axioms that axiomatize them.

  7. object LambdaEliminationReduction extends OneWayReduction_[HOLSequent] with Product with Serializable

    Permalink

    Replaces lambda abstractions by fresh function symbols, together with axioms that axiomatize them.

  8. object PredicateReductionCNF extends Reduction_[Set[HOLClause], ResolutionProof] with Product with Serializable

    Permalink

    Simplifies the problem of finding a resolution refutation of a many-sorted clause set by adding predicates for each of the sorts.

    Simplifies the problem of finding a resolution refutation of a many-sorted clause set by adding predicates for each of the sorts. The resulting problem is still many-sorted.

  9. object PredicateReductionET extends Reduction_[HOLSequent, ExpansionProof] with Product with Serializable

    Permalink

    Simplifies the problem of finding an expansion proof of a many-sorted sequent by adding predicates for each of the sorts.

    Simplifies the problem of finding an expansion proof of a many-sorted sequent by adding predicates for each of the sorts. The resulting problem is still many-sorted.

Ungrouped