Object

at.logic.gapt.cli.GAPScalaInteractiveShellLibrary

CERESomega

Related Doc: package GAPScalaInteractiveShellLibrary

Permalink

object CERESomega extends ceres_omega

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. CERESomega
  2. ceres_omega
  3. AnyRef
  4. 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. def apply(projections: Set[LKProof], ralproof: RalResolutionProof[LabelledOccSequent], es: LabelledOccSequent, struct: Struct): (LKProof, LabelledOccSequent)

    Permalink

    Applies the CERES_omega method to a proof.

    Applies the CERES_omega method to a proof.

    projections

    This is the set of projections to use. A projection to reflexvity is generated if needed.

    ralproof

    The R_al proof to use as skeleton.

    es

    The end-sequent of the original proof.

    struct

    The struct of the original proof. (unused at the moment)

    returns

    a pair of an LKProof with atomic cuts only and of the subsequent of its root which corresponds the Ral sequent

    Definition Classes
    ceres_omega
  5. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def contractEndsequent(p: LKProof, es: LabelledOccSequent): LKProof

    Permalink

    After an application of a binary rule, end-sequent material might be duplicated.

    After an application of a binary rule, end-sequent material might be duplicated. This method adds contractions for every end-sequent formula.

    p

    a proof with an end-sequent of the form: es x es x C (where C is some additional content)

    es

    the end-sequent material which occurs twice

    returns

    a proof with an end-sequent of the form: es x C

    Definition Classes
    ceres_omega
  8. def diffModuloOccurrence(from: Seq[LabelledFormulaOccurrence], what: Seq[LabelledFormulaOccurrence]): List[LabelledFormulaOccurrence]

    Permalink
    Definition Classes
    ceres_omega
  9. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  11. def filterByAncestor(sequent: OccSequent, anc: LabelledOccSequent): LabelledOccSequent

    Permalink
    Definition Classes
    ceres_omega
  12. def filterEndsequent(root: LabelledOccSequent, es: LabelledOccSequent, struct: Struct): LabelledOccSequent

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. def findAux(candidates: Seq[LabelledFormulaOccurrence], pred: (LabelledFormulaOccurrence) ⇒ Boolean, exclusion_list: Seq[LabelledFormulaOccurrence]): LabelledFormulaOccurrence

    Permalink

    Finds the first element in candidates - exclucsion_list fulfilling the predicate pred.

    Finds the first element in candidates - exclucsion_list fulfilling the predicate pred. Throws an IllegalArgumentException, if none is found.

    candidates

    the list of candidates to choose from

    pred

    a predicate on formula occurrences

    exclusion_list

    no candidate in exclusion_list will match

    returns

    the first element of candidates which fulfills the criteria

    Definition Classes
    ceres_omega
    Exceptions thrown

    IllegalArgumentException if no candidate fulfills pred.

  15. def findAuxByFormulaAndLabel(formula: HOLFormula, skolem_label: Label, candidates: Seq[LabelledFormulaOccurrence], exclusion_list: Seq[LabelledFormulaOccurrence]): LabelledFormulaOccurrence

    Permalink

    Finds an occurrence in candidates - exclusion_list, which has the same formula and label as aux.

    Finds an occurrence in candidates - exclusion_list, which has the same formula and label as aux.

    returns

    the first occurrence in candidates which matches

    Definition Classes
    ceres_omega
  16. def findAuxByFormulaAndLabel(aux: LabelledFormulaOccurrence, candidates: Seq[LabelledFormulaOccurrence], exclusion_list: Seq[LabelledFormulaOccurrence]): LabelledFormulaOccurrence

    Permalink

    Finds an occurrence in candidates - exclusion_list, which has the same formula and label as aux.

    Finds an occurrence in candidates - exclusion_list, which has the same formula and label as aux.

    returns

    the first occurrence in candidates which matches

    Definition Classes
    ceres_omega
  17. def firstAncestors(fo: LabelledFormulaOccurrence): List[LabelledFormulaOccurrence]

    Permalink

    Computes the list of earliest ancestors of the formula occurrence.

    Computes the list of earliest ancestors of the formula occurrence. I.e. we calculate the least elements of all ancestors of the occurrence with regard to the ancestorship relation.

    fo

    a formula occurrence

    returns

    the list of first ancestors

    Definition Classes
    ceres_omega
  18. def firstAncestors(fo: FormulaOccurrence): List[FormulaOccurrence]

    Permalink

    Computes the list of earliest ancestors of the formula occurrence.

    Computes the list of earliest ancestors of the formula occurrence. I.e. we calculate the least elements of all ancestors of the occurrence with regard to the ancestorship relation.

    fo

    a formula occurrence

    returns

    the list of first ancestors

    Definition Classes
    ceres_omega
  19. final def getClass(): Class[_]

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

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

    Permalink
    Definition Classes
    Any
  22. val nLine: String

    Permalink
    Definition Classes
    ceres_omega
  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. def pickFOWithAncestor(l: Seq[LabelledFormulaOccurrence], anc: LabelledFormulaOccurrence): LabelledFormulaOccurrence

    Permalink
    Definition Classes
    ceres_omega
  27. def pickFOWithAncestor(l: Seq[FormulaOccurrence], anc: FormulaOccurrence): FormulaOccurrence

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  30. def tranAncestors(fo: LabelledFormulaOccurrence): List[LabelledFormulaOccurrence]

    Permalink

    Computes the reflexive, transitive closure of the ancestor relation, ie.

    Computes the reflexive, transitive closure of the ancestor relation, ie. all ancestors.

    fo

    a formula occurrence

    returns

    the list of all ancestors

    Definition Classes
    ceres_omega
  31. def tranAncestors(fo: FormulaOccurrence): List[FormulaOccurrence]

    Permalink

    Computes the reflexive, transitive closure of the ancestor relation, ie.

    Computes the reflexive, transitive closure of the ancestor relation, ie. all ancestors.

    fo

    a formula occurrence

    returns

    the list of all ancestors

    Definition Classes
    ceres_omega
  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 ceres_omega

Inherited from AnyRef

Inherited from Any

Ungrouped