Class/Object

ap.proof.tree

StrengthenTree

Related Docs: object StrengthenTree | package tree

Permalink

class StrengthenTree extends ProofTreeOneChild

ProofTreeOneChild that strengthens the closing constraint of its subtree by conjoining a formula

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. StrengthenTree
  2. ProofTreeOneChild
  3. ProofTree
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def bindingContext: BindingContext

    Permalink
    Definition Classes
    ProofTree
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. lazy val closingConstantFreedom: ConstantFreedom

    Permalink

    The constants that can be considered free (resp., that have to be considered non-free) in this proof tree.

    The constants that can be considered free (resp., that have to be considered non-free) in this proof tree.

    Definition Classes
    StrengthenTreeProofTree
  8. lazy val closingConstraint: Conjunction

    Permalink

    The fully simplified closing constraint

    The fully simplified closing constraint

    Definition Classes
    StrengthenTreeProofTree
  9. val conjunct: Conjunction

    Permalink
  10. def constantFreedom: ConstantFreedom

    Permalink
    Definition Classes
    ProofTree
  11. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. lazy val fixedConstantFreedom: Boolean

    Permalink

    true if the sets of free constants have reached a fixed point

    true if the sets of free constants have reached a fixed point

    Definition Classes
    StrengthenTreeProofTree
  15. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  19. def newConstantFreedomForSubtree(cf: ConstantFreedom): ConstantFreedom

    Permalink

    Given a new constant freedom for this proof tree, derive the corresponding freedom for the direct subtree.

    Given a new constant freedom for this proof tree, derive the corresponding freedom for the direct subtree.

    Definition Classes
    StrengthenTreeProofTreeOneChild
  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. def order: TermOrder

    Permalink
    Definition Classes
    ProofTree
  23. lazy val stepMeaningful: Boolean

    Permalink

    true if there are chances that the closingConstraint of this tree changes by applying rules to any goal

    true if there are chances that the closingConstraint of this tree changes by applying rules to any goal

    Definition Classes
    StrengthenTreeProofTree
  24. lazy val stepPossible: Boolean

    Permalink

    true if it is possible to apply rules to any goal in this tree

    true if it is possible to apply rules to any goal in this tree

    Definition Classes
    ProofTreeOneChildProofTree
  25. val subtree: ProofTree

    Permalink
    Definition Classes
    StrengthenTreeProofTreeOneChild
  26. val subtreeOrder: TermOrder

    Permalink
    Attributes
    protected
    Definition Classes
    StrengthenTreeProofTreeOneChild
  27. lazy val subtrees: Seq[ProofTree]

    Permalink
    Definition Classes
    ProofTreeOneChildProofTree
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  29. def toString(): String

    Permalink
    Definition Classes
    StrengthenTree → AnyRef → Any
  30. def update(newSubtree: ProofTree, newConstantFreedom: ConstantFreedom): ProofTree

    Permalink

    Replace the subtree and the constant freedom status with new values.

    Replace the subtree and the constant freedom status with new values.

    Definition Classes
    StrengthenTreeProofTreeOneChild
  31. val vocabulary: Vocabulary

    Permalink

    the vocabulary available at a certain node in the proof

    the vocabulary available at a certain node in the proof

    Definition Classes
    StrengthenTreeProofTree
  32. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from ProofTreeOneChild

Inherited from ProofTree

Inherited from AnyRef

Inherited from Any

Ungrouped