Class/Object

ap.proof.certificates

BranchInferenceCertificate

Related Docs: object BranchInferenceCertificate | package certificates

Permalink

case class BranchInferenceCertificate(inferences: Seq[BranchInference], _child: Certificate, order: TermOrder) extends CertificateOneChild with Product with Serializable

Inferences that do not cause proof splitting and that do not close a branch are collected in nodes of this class.

Linear Supertypes
Serializable, Serializable, Product, Equals, CertificateOneChild, Certificate, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. BranchInferenceCertificate
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. CertificateOneChild
  7. Certificate
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BranchInferenceCertificate(inferences: Seq[BranchInference], _child: Certificate, order: TermOrder)

    Permalink

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. val _child: Certificate

    Permalink
  5. def apply(i: Int): Certificate

    Permalink
    Definition Classes
    CertificateOneChildCertificate
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. lazy val assumedFormulas: Set[CertFormula]

    Permalink

    Formulae that the proof assumes to be present on this branch (i.e., premisses of rules applied in the proof).

    Formulae that the proof assumes to be present on this branch (i.e., premisses of rules applied in the proof). We assume that all formulae live in the antecedent.

    Definition Classes
    Certificate
  8. val child: Certificate

    Permalink
    Definition Classes
    CertificateOneChild
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. val closingConstraint: Conjunction

    Permalink

    The constraint resulting from this proof

    The constraint resulting from this proof

    Definition Classes
    BranchInferenceCertificateCertificate
  11. lazy val constants: Set[ConstantTerm]

    Permalink

    Set of constants occurring in this certificate.

    Set of constants occurring in this certificate. By default this will contain the set of all constants in sub-certificates, as well as constants in assumed formulas.

    Definition Classes
    BranchInferenceCertificateCertificate
  12. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  15. val hashCode: Int

    Permalink
    Definition Classes
    BranchInferenceCertificate → AnyRef → Any
  16. lazy val inferenceCount: Int

    Permalink
  17. val inferences: Seq[BranchInference]

    Permalink
  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  19. def iterator: Iterator[Certificate]

    Permalink
    Definition Classes
    CertificateOneChildCertificate
  20. def length: Int

    Permalink
    Definition Classes
    CertificateOneChildCertificate
  21. val localAssumedFormulas: Set[CertFormula]

    Permalink
  22. val localBoundConstants: Set[ConstantTerm]

    Permalink

    Constants bound by the root operator of the certificate.

    Constants bound by the root operator of the certificate.

    Definition Classes
    BranchInferenceCertificateCertificate
  23. lazy val localProvidedFormulas: Seq[Set[CertFormula]]

    Permalink

    Formulae that are introduced into the antecedent by this rule application (one set for each subproof).

    Formulae that are introduced into the antecedent by this rule application (one set for each subproof). This will implicitly simplify formulae (all simplifications that are built into the datastructures are carried out).

    Definition Classes
    CertificateOneChildCertificate
  24. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  25. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  27. val order: TermOrder

    Permalink
  28. def size: Int

    Permalink
    Definition Classes
    Certificate
  29. def subCertificates: IndexedSeq[Certificate]

    Permalink
    Definition Classes
    Certificate
  30. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  31. lazy val theoryAxioms: Set[CertFormula]

    Permalink
    Definition Classes
    Certificate
  32. def toString(): String

    Permalink
    Definition Classes
    BranchInferenceCertificate → AnyRef → Any
  33. val uniqueLocalProvidedFormulas: Set[CertFormula]

    Permalink
  34. def update(newSubCerts: Seq[Certificate]): Certificate

    Permalink
  35. final def wait(): Unit

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from CertificateOneChild

Inherited from Certificate

Inherited from AnyRef

Inherited from Any

Ungrouped