object improveSolutionLK
- Source
- improveSolutionLK.scala
- Alphabetic
- By Inheritance
- improveSolutionLK
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(ehs: SolutionStructure, prover: Prover, hasEquality: Boolean, forgetOne: Boolean = false, minimizeBack: Boolean = false): SolutionStructure
Improves the cut-formulas in an EHS by performing forgetful resolution and paramodulation on them.
Improves the cut-formulas in an EHS by performing forgetful resolution and paramodulation on them.
Maintains the invariant that the cut-formulas can be realized in an LK proof.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
improve(context: HOLSequent, start: Formula, instances: Set[Substitution], prover: Prover, hasEquality: Boolean, forgetOne: Boolean): Formula
Improves a formula with regard to its logical complexity by taking consequences under the constraint that the following sequent is valid:
Improves a formula with regard to its logical complexity by taking consequences under the constraint that the following sequent is valid:
instances(0)(formula) +: ... +: instances(n)(formula) +: context
- context
A sequent.
- start
Existing solution of the constraint.
- instances
List of substitutions, the intended usage are the instances of a cut-formula in an EHS.
- prover
Prover to check the validity of the constraint.
- hasEquality
If set to true, use forgetful paramodulation in addition to resolution.
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
This is the API documentation for GAPT.
The main package is gapt.