Class/Object

ap.proof.tree

WeakenTree

Related Docs: object WeakenTree | package tree

Permalink

class WeakenTree extends ProofTreeOneChild

ProofTreeOneChild that weakens the closing constraint of its subtree by disjunctively adding a formula

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WeakenTree
  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
    @HotSpotIntrinsicCandidate() @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
    WeakenTreeProofTree
  8. lazy val closingConstraint: Conjunction

    Permalink

    The fully simplified closing constraint

    The fully simplified closing constraint

    Definition Classes
    WeakenTreeProofTree
  9. def constantFreedom: ConstantFreedom

    Permalink
    Definition Classes
    ProofTree
  10. val disjunct: Conjunction

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  13. 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
    WeakenTreeProofTree
  14. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()
  15. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()
  16. final def isInstanceOf[T0]: Boolean

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

    Permalink
    Definition Classes
    AnyRef
  18. 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
    WeakenTreeProofTreeOneChild
  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()
  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()
  21. def order: TermOrder

    Permalink
    Definition Classes
    ProofTree
  22. 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
    WeakenTreeProofTree
  23. 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
  24. val subtree: ProofTree

    Permalink
    Definition Classes
    WeakenTreeProofTreeOneChild
  25. val subtreeOrder: TermOrder

    Permalink
    Attributes
    protected
    Definition Classes
    WeakenTreeProofTreeOneChild
  26. lazy val subtrees: Seq[ProofTree]

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

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

    Permalink
    Definition Classes
    WeakenTree → AnyRef → Any
  29. 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
    WeakenTreeProofTreeOneChild
  30. 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
    WeakenTreeProofTree
  31. final def wait(arg0: Long, arg1: Int): Unit

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(): Unit

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

Deprecated Value Members

  1. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from ProofTreeOneChild

Inherited from ProofTree

Inherited from AnyRef

Inherited from Any

Ungrouped