Class

ap.proof.certificates.DagCertificateConverter

ReferenceCertificate

Related Doc: package DagCertificateConverter

Permalink

case class ReferenceCertificate(id: Int, localAssumedFormulas: Set[CertFormula], additionalConstants: Set[ConstantTerm], closingConstraint: Conjunction, order: TermOrder) extends Certificate with Product with Serializable

Certificate representing a sub-proof that is stored at index plus id in the certificate vector.

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

Instance Constructors

  1. new ReferenceCertificate(id: Int, localAssumedFormulas: Set[CertFormula], additionalConstants: Set[ConstantTerm], closingConstraint: Conjunction, 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 additionalConstants: Set[ConstantTerm]

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

    Permalink
    Definition Classes
    ReferenceCertificateCertificate
  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. def clone(): AnyRef

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

    Permalink

    The constraint resulting from this proof

    The constraint resulting from this proof

    Definition Classes
    ReferenceCertificateCertificate
  10. 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
    Certificate
  11. final def eq(arg0: AnyRef): Boolean

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

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

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

    Permalink
    Definition Classes
    ReferenceCertificate → AnyRef → Any
  15. val id: Int

    Permalink
  16. lazy val inferenceCount: Int

    Permalink
    Definition Classes
    Certificate
  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  18. def iterator: Iterator[Nothing]

    Permalink
    Definition Classes
    ReferenceCertificateCertificate
  19. def length: Int

    Permalink
    Definition Classes
    ReferenceCertificateCertificate
  20. val localAssumedFormulas: Set[CertFormula]

    Permalink
    Definition Classes
    ReferenceCertificateCertificate
  21. 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
    Certificate
  22. val localProvidedFormulas: List[Nothing]

    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
    ReferenceCertificateCertificate
  23. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  26. val order: TermOrder

    Permalink
    Definition Classes
    ReferenceCertificateCertificate
  27. def size: Int

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

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

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

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

    Permalink
    Definition Classes
    ReferenceCertificate → AnyRef → Any
  32. def update(newSubCerts: Seq[Certificate]): Certificate

    Permalink
    Definition Classes
    ReferenceCertificateCertificate
  33. final def wait(): Unit

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. 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 Certificate

Inherited from AnyRef

Inherited from Any

Ungrouped