Class

at.logic.gapt.proofs.resolution

AllL

Related Doc: package resolution

Permalink

case class AllL(subProof: ResolutionProof, idx: SequentIndex, skolemTerm: LambdaExpression, skolemDef: LambdaExpression) extends SkolemQuantResolutionRule with Product with Serializable

Source
resolution.scala
Linear Supertypes
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AllL
  2. Serializable
  3. Serializable
  4. SkolemQuantResolutionRule
  5. PropositionalResolutionRule
  6. LocalResolutionRule
  7. ContextRule
  8. ResolutionProof
  9. SequentProof
  10. DagProof
  11. Product
  12. Equals
  13. AnyRef
  14. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AllL(subProof: ResolutionProof, idx: SequentIndex, skolemTerm: LambdaExpression, skolemDef: LambdaExpression)

    Permalink

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from AllL to any2stringadd[AllL] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (AllL, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from AllL to ArrowAssoc[AllL] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean

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

    Permalink
    Definition Classes
    Any
  7. val assertions: HOLClause

    Permalink

    Assertions of the proof.

    Assertions of the proof.

    Attention: this is interpreted as assertions.toNegConjunction --> conclusion.toDisjunction

    These assertions indicate the splitting assumptions this proof depends on.

    Definition Classes
    ResolutionProof
  8. def auxFormulas: Seq[Seq[HOLFormula]]

    Permalink

    A list of lists containing the auxiliary formulas of the rule.

    A list of lists containing the auxiliary formulas of the rule. The first list constains the auxiliary formulas in the first premise and so on.

    Definition Classes
    SequentProof
  9. def auxIndices: Seq[Seq[SequentIndex]]

    Permalink

    A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule.

    A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule. The first list contains the auxiliary formulas in the first premise and so on.

    Definition Classes
    PropositionalResolutionRuleSequentProof
  10. val bound: Var

    Permalink
    Definition Classes
    AllLSkolemQuantResolutionRule
  11. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. lazy val conclusion: Sequent[HOLFormula]

    Permalink

    The conclusion of the rule.

    The conclusion of the rule.

    Definition Classes
    ContextRuleSequentProof
  13. def conclusionString: String

    Permalink
    Definition Classes
    ResolutionProof
  14. def contexts: Seq[Sequent[HOLFormula]]

    Permalink
    Attributes
    protected
    Definition Classes
    ContextRule
  15. def dagLike: DagLikeOps[ResolutionProof]

    Permalink

    Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.

    Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.

    Definition Classes
    DagProof
  16. def definitions: Map[HOLAtomConst, LambdaExpression]

    Permalink

    All definitions introduced by any subproof.

    All definitions introduced by any subproof.

    Definition Classes
    ResolutionProof
    Exceptions thrown

    Exception if inconsistent definitions are used

  17. def depth: Int

    Permalink

    Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.

    Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.

    Definition Classes
    DagProof
  18. def ensuring(cond: (AllL) ⇒ Boolean, msg: ⇒ Any): AllL

    Permalink
    Implicit information
    This member is added by an implicit conversion from AllL to Ensuring[AllL] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  19. def ensuring(cond: (AllL) ⇒ Boolean): AllL

    Permalink
    Implicit information
    This member is added by an implicit conversion from AllL to Ensuring[AllL] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  20. def ensuring(cond: Boolean, msg: ⇒ Any): AllL

    Permalink
    Implicit information
    This member is added by an implicit conversion from AllL to Ensuring[AllL] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  21. def ensuring(cond: Boolean): AllL

    Permalink
    Implicit information
    This member is added by an implicit conversion from AllL to Ensuring[AllL] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  22. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  23. def equals(that: Any): Boolean

    Permalink
    Definition Classes
    DagProof → Equals → AnyRef → Any
  24. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  25. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from AllL to StringFormat[AllL] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  26. def formulasToBeDeleted: Seq[Seq[SequentIndex]]

    Permalink
    Attributes
    protected
    Definition Classes
    ContextRule
  27. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    DagProof → AnyRef → Any
  29. val idx: SequentIndex

    Permalink
    Definition Classes
    AllLPropositionalResolutionRule
  30. def immediateSubProofs: Seq[ResolutionProof]

    Permalink

    The immediate subproofs of this rule.

    The immediate subproofs of this rule.

    Definition Classes
    PropositionalResolutionRuleDagProof
  31. def instFormula: HOLFormula

    Permalink
    Definition Classes
    SkolemQuantResolutionRule
  32. def introducedDefinitions: Map[HOLAtomConst, LambdaExpression]

    Permalink

    Definitions introduced by the bottom-most inference rule.

    Definitions introduced by the bottom-most inference rule.

    Definition Classes
    ResolutionProof
  33. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  34. def isProof: Boolean

    Permalink

    Is this a proof of the empty clause with empty assertions, and consistent definitions?

    Is this a proof of the empty clause with empty assertions, and consistent definitions?

    Definition Classes
    ResolutionProof
  35. def longName: String

    Permalink

    The name of this rule (in words).

    The name of this rule (in words).

    Definition Classes
    DagProof
  36. def mainFormulaSequent: Sequent[HOLFormula]

    Permalink
    Definition Classes
    AllLContextRule
  37. def mainFormulas: Seq[HOLFormula]

    Permalink

    The list of main formulas of the rule.

    The list of main formulas of the rule.

    Definition Classes
    SequentProof
  38. def mainIndices: Seq[SequentIndex]

    Permalink

    A list of SequentIndices denoting the main formula(s) of the rule.

    A list of SequentIndices denoting the main formula(s) of the rule.

    Definition Classes
    ContextRuleSequentProof
  39. def name: String

    Permalink

    The name of this rule (in symbols).

    The name of this rule (in symbols).

    Definition Classes
    DagProof
  40. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  43. def occConnectors: Seq[OccConnector[HOLFormula]]

    Permalink

    A list of occurrence connectors, one for each immediate subproof.

    A list of occurrence connectors, one for each immediate subproof.

    Definition Classes
    ContextRuleSequentProof
  44. def premises: Seq[Sequent[HOLFormula]]

    Permalink

    The upper sequents of the rule.

    The upper sequents of the rule.

    Definition Classes
    SequentProof
  45. val skolemArgs: List[LambdaExpression]

    Permalink
    Definition Classes
    SkolemQuantResolutionRule
  46. val skolemConst: Const

    Permalink
    Definition Classes
    SkolemQuantResolutionRule
  47. val skolemDef: LambdaExpression

    Permalink
    Definition Classes
    AllLSkolemQuantResolutionRule
  48. val skolemTerm: LambdaExpression

    Permalink
    Definition Classes
    AllLSkolemQuantResolutionRule
  49. def stepString(subProofLabels: Map[Any, String]): String

    Permalink
    Attributes
    protected
    Definition Classes
    ResolutionProofSequentProofDagProof
  50. val sub: HOLFormula

    Permalink
    Definition Classes
    AllLSkolemQuantResolutionRule
  51. val subProof: ResolutionProof

    Permalink
    Definition Classes
    AllLPropositionalResolutionRule
  52. def subProofs: Set[ResolutionProof]

    Permalink

    Set of all (transitive) sub-proofs including this.

    Set of all (transitive) sub-proofs including this.

    Definition Classes
    DagProof
  53. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Permalink
    Definition Classes
    DagProof → AnyRef → Any
  55. def treeLike: TreeLikeOps[ResolutionProof]

    Permalink

    Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.

    Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.

    Definition Classes
    DagProof
  56. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  59. def [B](y: B): (AllL, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from AllL to ArrowAssoc[AllL] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from Serializable

Inherited from Serializable

Inherited from SkolemQuantResolutionRule

Inherited from LocalResolutionRule

Inherited from ResolutionProof

Inherited from DagProof[ResolutionProof]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from AllL to any2stringadd[AllL]

Inherited by implicit conversion StringFormat from AllL to StringFormat[AllL]

Inherited by implicit conversion Ensuring from AllL to Ensuring[AllL]

Inherited by implicit conversion ArrowAssoc from AllL to ArrowAssoc[AllL]

Ungrouped