case class OrR(subProof: ResolutionProof, idx: SequentIndex) extends PropositionalResolutionRule with Product with Serializable
- Source
- resolution.scala
- Alphabetic
- By Inheritance
- OrR
- Serializable
- Serializable
- PropositionalResolutionRule
- LocalResolutionRule
- ContextRule
- ResolutionProof
- SequentProof
- DagProof
- Product
- Equals
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Instance Constructors
- new OrR(subProof: ResolutionProof, idx: SequentIndex)
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (OrR, B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
val
assertions: HOLClause
Assertions of the proof.
Assertions of the proof.
Attention: this is interpreted as
assertions.toNegConjunction --> conclusion.toDisjunctionThese assertions indicate the splitting assumptions this proof depends on.
- Definition Classes
- ResolutionProof
-
def
auxFormulas: Seq[Seq[Formula]]
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
-
def
auxIndices: Seq[Seq[SequentIndex]]
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
- PropositionalResolutionRule → SequentProof
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
lazy val
conclusion: Sequent[Formula]
The conclusion of the rule.
The conclusion of the rule.
- Definition Classes
- ContextRule → SequentProof
-
def
contexts: Seq[Sequent[Formula]]
- Attributes
- protected
- Definition Classes
- ContextRule
-
def
dagLike: DagLikeOps[ResolutionProof]
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
-
def
definitions: Map[HOLAtomConst, Expr]
All definitions introduced by any subproof.
All definitions introduced by any subproof.
throws java.lang.Exception if inconsistent definitions are used
- Definition Classes
- ResolutionProof
-
def
depth: Int
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
- def ensuring(cond: (OrR) ⇒ Boolean, msg: ⇒ Any): OrR
- def ensuring(cond: (OrR) ⇒ Boolean): OrR
- def ensuring(cond: Boolean, msg: ⇒ Any): OrR
- def ensuring(cond: Boolean): OrR
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- DagProof → Equals → AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
def
formulasToBeDeleted: Seq[Seq[SequentIndex]]
- Attributes
- protected
- Definition Classes
- ContextRule
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
val
hashCode: Int
- Definition Classes
- DagProof
-
val
idx: SequentIndex
- Definition Classes
- OrR → PropositionalResolutionRule
-
def
immediateSubProofs: Seq[ResolutionProof]
The immediate subproofs of this rule.
The immediate subproofs of this rule.
- Definition Classes
- PropositionalResolutionRule → DagProof
-
def
introducedDefinitions: Map[HOLAtomConst, Expr]
Definitions introduced by the bottom-most inference rule.
Definitions introduced by the bottom-most inference rule.
- Definition Classes
- ResolutionProof
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isProof: Boolean
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
-
def
longName: String
The name of this rule (in words).
The name of this rule (in words).
- Definition Classes
- DagProof
-
def
mainFormulaSequent: Sequent[Formula]
- Definition Classes
- OrR → ContextRule
-
def
mainFormulas: Seq[Formula]
The list of main formulas of the rule.
The list of main formulas of the rule.
- Definition Classes
- SequentProof
-
def
mainIndices: Vector[SequentIndex]
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
- ContextRule → SequentProof
-
def
name: String
The name of this rule (in symbols).
The name of this rule (in symbols).
- Definition Classes
- DagProof
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
occConn: SequentConnector
- Definition Classes
- PropositionalResolutionRule
-
def
occConnectors: Seq[SequentConnector]
A list of occurrence connectors, one for each immediate subproof.
A list of occurrence connectors, one for each immediate subproof.
- Definition Classes
- ContextRule → SequentProof
-
def
premises: Seq[Sequent[Formula]]
The upper sequents of the rule.
The upper sequents of the rule.
- Definition Classes
- SequentProof
-
def
skolemFunctions: SkolemFunctions
- Definition Classes
- ResolutionProof
-
def
stepString(subProofLabels: Map[Any, String]): String
- Attributes
- protected
- Definition Classes
- ResolutionProof → SequentProof → DagProof
-
def
stringifiedConclusion(implicit sig: BabelSignature): String
- Definition Classes
- ResolutionProof
- val sub1: Formula
- val sub2: Formula
-
val
subProof: ResolutionProof
- Definition Classes
- OrR → PropositionalResolutionRule
-
def
subProofAt(pos: List[Int]): ResolutionProof
Returns the subproof at the given position: p.subProofAt(Nil) is p itself; p.subProofAt(i :: is) is the ith subproof of p.subProofAt(is).
Returns the subproof at the given position: p.subProofAt(Nil) is p itself; p.subProofAt(i :: is) is the ith subproof of p.subProofAt(is).
- Definition Classes
- DagProof
-
def
subProofs: Set[ResolutionProof]
Set of all (transitive) sub-proofs including this.
Set of all (transitive) sub-proofs including this.
- Definition Classes
- DagProof
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- DagProof → AnyRef → Any
-
def
treeLike: TreeLikeOps[ResolutionProof]
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
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def →[B](y: B): (OrR, B)
This is the API documentation for GAPT.
The main package is at.logic.gapt.