case class SketchAxiom(axiom: FOLClause) extends RefutationSketch with Product with Serializable
Axiom in a refutation sketch.
The clause axiom occurs as a clause in the CNF of the end-sequent we're proving.
- axiom
Clause of the CNF.
- Source
- refutationSketch.scala
- Alphabetic
- By Inheritance
- SketchAxiom
- Serializable
- Serializable
- RefutationSketch
- SequentProof
- DagProof
- Product
- Equals
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from SketchAxiom to any2stringadd[SketchAxiom] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
->[B](y: B): (SketchAxiom, B)
- Implicit
- This member is added by an implicit conversion from SketchAxiom to ArrowAssoc[SketchAxiom] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
auxFormulas: Seq[Seq[FOLAtom]]
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
- RefutationSketch → SequentProof
- val axiom: FOLClause
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
conclusion: FOLClause
The conclusion of the rule.
The conclusion of the rule.
- Definition Classes
- SketchAxiom → SequentProof
-
def
dagLike: DagLikeOps[RefutationSketch]
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
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: (SketchAxiom) ⇒ Boolean, msg: ⇒ Any): SketchAxiom
- Implicit
- This member is added by an implicit conversion from SketchAxiom to Ensuring[SketchAxiom] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (SketchAxiom) ⇒ Boolean): SketchAxiom
- Implicit
- This member is added by an implicit conversion from SketchAxiom to Ensuring[SketchAxiom] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): SketchAxiom
- Implicit
- This member is added by an implicit conversion from SketchAxiom to Ensuring[SketchAxiom] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): SketchAxiom
- Implicit
- This member is added by an implicit conversion from SketchAxiom to Ensuring[SketchAxiom] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
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
- Implicit
- This member is added by an implicit conversion from SketchAxiom to StringFormat[SketchAxiom] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
val
hashCode: Int
- Definition Classes
- DagProof
-
def
immediateSubProofs: Seq[RefutationSketch]
The immediate subproofs of this rule.
The immediate subproofs of this rule.
- Definition Classes
- SketchAxiom → DagProof
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
longName: String
The name of this rule (in words).
The name of this rule (in words).
- Definition Classes
- DagProof
-
def
mainFormulas: Seq[FOLAtom]
The list of main formulas of the rule.
The list of main formulas of the rule.
- Definition Classes
- SequentProof
-
def
mainIndices: Seq[Nothing]
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
- RefutationSketch → 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
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
- RefutationSketch → SequentProof
-
def
premises: Seq[Sequent[FOLAtom]]
The upper sequents of the rule.
The upper sequents of the rule.
- Definition Classes
- SequentProof
-
def
stepString(subProofLabels: Map[Any, String]): String
- Attributes
- protected
- Definition Classes
- SequentProof → DagProof
-
def
subProofAt(pos: List[Int]): RefutationSketch
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[RefutationSketch]
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[RefutationSketch]
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): (SketchAxiom, B)
- Implicit
- This member is added by an implicit conversion from SketchAxiom to ArrowAssoc[SketchAxiom] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
This is the API documentation for GAPT.
The main package is at.logic.gapt.