Uses of Class
uk.ac.manchester.cs.jfact.helpers.DLTree

Packages that use DLTree

Package	Description
uk.ac.manchester.cs.jfact.helpers
uk.ac.manchester.cs.jfact.kernel

Uses of DLTree in uk.ac.manchester.cs.jfact.helpers

Fields in uk.ac.manchester.cs.jfact.helpers declared as DLTree

Modifier and Type	Field and Description
protected DLTree	DLTree.ancestor

Fields in uk.ac.manchester.cs.jfact.helpers with type parameters of type DLTree

Modifier and Type	Field and Description
protected List<DLTree>	DLTree.children children collection

Methods in uk.ac.manchester.cs.jfact.helpers that return DLTree

Modifier and Type	Method and Description
static DLTree	DLTreeFactory.buildDisjAux(List<DLTree> beg) build a construction in the form AND (\neg q_i)
static DLTree	DLTreeFactory.buildTree(Lexeme t)
static DLTree	DLTreeFactory.buildTree(Lexeme t, DLTree t1)
static DLTree	DLTreeFactory.buildTree(Lexeme t, DLTree t1, DLTree t2)
DLTree	DLTree.copy()
static DLTree	DLTreeFactory.createBottom() create BOTTOM element
static DLTree	DLTreeFactory.createEntry(Token tag, NamedEntry entry)
static DLTree	DLTreeFactory.createInverse(DLTree R)
static DLTree	DLTreeFactory.createRole(Role R)
static DLTree	DLTreeFactory.createSNFAnd(Collection<DLTree> collection)
static DLTree	DLTreeFactory.createSNFAnd(Collection<DLTree> collection, DLTree ancestor)
static DLTree	DLTreeFactory.createSNFAnd(DLTree C, DLTree D)
static DLTree	DLTreeFactory.createSNFExists(DLTree R, DLTree C) create existential restriction of given formulas (\ER.C)
static DLTree	DLTreeFactory.createSNFForall(DLTree R, DLTree C)
static DLTree	DLTreeFactory.createSNFGE(int n, DLTree R, DLTree C)
static DLTree	DLTreeFactory.createSNFLE(int n, DLTree R, DLTree C) create at-most (LE) restriction of given formulas (<= n R.C)
static DLTree	DLTreeFactory.createSNFNot(DLTree C)
static DLTree	DLTreeFactory.createSNFNot(DLTree C, DLTree ancestor)
static DLTree	DLTreeFactory.createSNFOr(Collection<DLTree> C) create disjunction of given formulas
static DLTree	DLTreeFactory.createSNFSelf(DLTree R) create SELF restriction for role R
static DLTree	DLTreeFactory.createTop() create TOP element
DLTree	DLTree.getAncestor()
abstract DLTree	DLTree.getChild()
abstract DLTree	DLTree.getLeft()
abstract DLTree	DLTree.getRight()
static DLTree	DLTreeFactory.inverseComposition(DLTree tree)
static DLTree	DLTreeFactory.wrap(NamedEntry t) get DLTree by a given TDE

Methods in uk.ac.manchester.cs.jfact.helpers that return types with arguments of type DLTree

Modifier and Type	Method and Description
List<DLTree>	DLTree.getChildren()

Methods in uk.ac.manchester.cs.jfact.helpers with parameters of type DLTree

Modifier and Type	Method and Description
void	DLTree.addChild(DLTree d)
void	DLTree.addFirstChild(DLTree d)
static DLTree	DLTreeFactory.buildTree(Lexeme t, DLTree t1)
static DLTree	DLTreeFactory.buildTree(Lexeme t, DLTree t1, DLTree t2)
static DLTree	DLTreeFactory.createInverse(DLTree R)
static DLTree	DLTreeFactory.createSNFAnd(Collection<DLTree> collection, DLTree ancestor)
static DLTree	DLTreeFactory.createSNFAnd(DLTree C, DLTree D)
static DLTree	DLTreeFactory.createSNFExists(DLTree R, DLTree C) create existential restriction of given formulas (\ER.C)
static DLTree	DLTreeFactory.createSNFForall(DLTree R, DLTree C)
static DLTree	DLTreeFactory.createSNFGE(int n, DLTree R, DLTree C)
static DLTree	DLTreeFactory.createSNFLE(int n, DLTree R, DLTree C) create at-most (LE) restriction of given formulas (<= n R.C)
static DLTree	DLTreeFactory.createSNFNot(DLTree C)
static DLTree	DLTreeFactory.createSNFNot(DLTree C, DLTree ancestor)
static DLTree	DLTreeFactory.createSNFSelf(DLTree R) create SELF restriction for role R
static boolean	DLTree.equalTrees(DLTree t1, DLTree t2)
static DLTree	DLTreeFactory.inverseComposition(DLTree tree)
static boolean	DLTreeFactory.isBotRole(DLTree t) check whether T is a bottom (empty) role
static boolean	DLTreeFactory.isFunctionalExpr(DLTree t, NamedEntry R) check whether T is an expression in the form (atmost 1 RNAME)
static boolean	DLTreeFactory.isSNF(DLTree t)
static boolean	DLTreeFactory.isSubTree(DLTree t1, DLTree t2)
static boolean	DLTreeFactory.isTopRole(DLTree t) check whether T is a top (universal) role
static boolean	DLTreeFactory.isUniversalRole(DLTree t) check whether T is U-Role
abstract void	DLTree.replace(DLTree toReplace, DLTree replacement)
static boolean	DLTreeFactory.replaceSynonymsFromTree(DLTree desc)
void	DLTree.setAncestor(DLTree r)
static NamedEntry	DLTreeFactory.unwrap(DLTree t) get TDE by a given DLTree

Method parameters in uk.ac.manchester.cs.jfact.helpers with type arguments of type DLTree

Modifier and Type	Method and Description
void	DLTree.addFirstChildren(Collection<DLTree> d)
static DLTree	DLTreeFactory.buildDisjAux(List<DLTree> beg) build a construction in the form AND (\neg q_i)
static DLTree	DLTreeFactory.createSNFAnd(Collection<DLTree> collection)
static DLTree	DLTreeFactory.createSNFAnd(Collection<DLTree> collection, DLTree ancestor)
static DLTree	DLTreeFactory.createSNFOr(Collection<DLTree> C) create disjunction of given formulas

Uses of DLTree in uk.ac.manchester.cs.jfact.kernel

Fields in uk.ac.manchester.cs.jfact.kernel declared as DLTree

Modifier and Type	Field and Description
protected DLTree	Concept.description

Methods in uk.ac.manchester.cs.jfact.kernel that return DLTree

Modifier and Type	Method and Description
DLTree	TBox.applyAxiomCNToC(DLTree CN, DLTree D)
DLTree	TBox.applyAxiomCToCN(DLTree D, DLTree CN)
DLTree	Axiom.createAnAxiom(DLTree replaced) create a concept expression corresponding to a given GCI; ignore SKIP entry
DLTree	Concept.getDescription()
DLTree	TBox.getFreshConcept() get fresh concept
DLTree	AxiomSet.getGCI() get GCI of all non-absorbed axioms
DLTree	Role.getTDomain() get domain-as-a-tree of the role
DLTree	TBox.getTree(Concept C) get a DL tree by a given concept-like C
DLTree	Role.getTSpecialDomain()
DLTree	TBox.makeNonPrimitive(Concept p, DLTree desc) make concept non-primitive; @return it's old description
DLTree	Concept.makeNonPrimitive(DLTree desc) switch primitive concept to non-primitive with new definition; @return old definition
DLTree	ExpressionTranslator.visit(ConceptAnd expr)
DLTree	ExpressionTranslator.visit(ConceptBottom expr)
DLTree	ExpressionTranslator.visit(ConceptDataExactCardinality expr)
DLTree	ExpressionTranslator.visit(ConceptDataExists expr)
DLTree	ExpressionTranslator.visit(ConceptDataForall expr)
DLTree	ExpressionTranslator.visit(ConceptDataMaxCardinality expr)
DLTree	ExpressionTranslator.visit(ConceptDataMinCardinality expr)
DLTree	ExpressionTranslator.visit(ConceptDataValue expr)
DLTree	ExpressionTranslator.visit(ConceptName expr)
DLTree	ExpressionTranslator.visit(ConceptNot expr)
DLTree	ExpressionTranslator.visit(ConceptObjectExactCardinality expr)
DLTree	ExpressionTranslator.visit(ConceptObjectExists expr)
DLTree	ExpressionTranslator.visit(ConceptObjectForall expr)
DLTree	ExpressionTranslator.visit(ConceptObjectMaxCardinality expr)
DLTree	ExpressionTranslator.visit(ConceptObjectMinCardinality expr)
DLTree	ExpressionTranslator.visit(ConceptObjectSelf expr)
DLTree	ExpressionTranslator.visit(ConceptObjectValue expr)
DLTree	ExpressionTranslator.visit(ConceptOneOf expr)
DLTree	ExpressionTranslator.visit(ConceptOr expr)
DLTree	ExpressionTranslator.visit(ConceptTop expr)
DLTree	ExpressionTranslator.visit(DataAnd expr)
DLTree	ExpressionTranslator.visit(DataBottom expr)
DLTree	ExpressionTranslator.visit(DataNot expr)
DLTree	ExpressionTranslator.visit(DataOneOf expr)
DLTree	ExpressionTranslator.visit(DataOr expr)
DLTree	ExpressionTranslator.visit(DataRoleBottom expr)
DLTree	ExpressionTranslator.visit(DataRoleName expr)
DLTree	ExpressionTranslator.visit(DataRoleTop expr)
DLTree	ExpressionTranslator.visit(DataTop expr)
DLTree	ExpressionTranslator.visit(Datatype<?> expr)
DLTree	ExpressionTranslator.visit(IndividualName expr)
DLTree	ExpressionTranslator.visit(Literal<?> expr)
DLTree	ExpressionTranslator.visit(ObjectRoleBottom expr)
DLTree	ExpressionTranslator.visit(ObjectRoleChain expr)
DLTree	ExpressionTranslator.visit(ObjectRoleInverse expr)
DLTree	ExpressionTranslator.visit(ObjectRoleName expr)
DLTree	ExpressionTranslator.visit(ObjectRoleProjectionFrom expr)
DLTree	ExpressionTranslator.visit(ObjectRoleProjectionInto expr)
DLTree	ExpressionTranslator.visit(ObjectRoleTop expr)

Methods in uk.ac.manchester.cs.jfact.kernel with parameters of type DLTree

Modifier and Type	Method and Description
void	Axiom.add(DLTree p) add DLTree to an axiom
void	AxiomSet.addAxiom(DLTree C, DLTree D) add axiom for the GCI C [= D
void	Role.addComposition(DLTree tree) add composition to a role
void	Concept.addDesc(DLTree Desc)
boolean	TBox.addNonprimitiveDefinition(DLTree left, DLTree right)
void	RoleMaster.addRoleParent(DLTree tree, Role parent)
void	TBox.addSubsumeAxiom(Concept C, DLTree D) add axiom CN [= D for concept CN
void	TBox.addSubsumeAxiom(DLTree sub, DLTree sup)
void	TBox.addSubsumeForDefined(Concept C, DLTree D)
int	TBox.and2dag(DLVertex v, DLTree t) fills AND-like vertex V with an AND-like expression T; process result
DLTree	TBox.applyAxiomCNToC(DLTree CN, DLTree D)
DLTree	TBox.applyAxiomCToCN(DLTree D, DLTree CN)
boolean	TBox.axiomToRangeDomain(DLTree sub, DLTree sup)
boolean	Concept.canInitNonPrim(DLTree desc) check whether it is possible to init this as a non-primitive concept with DESC
DLTree	Axiom.createAnAxiom(DLTree replaced) create a concept expression corresponding to a given GCI; ignore SKIP entry
Concept	TBox.createQueryConcept(DLTree desc)
Concept	TBox.getCI(DLTree name) get TOP/BOTTOM/CN/IN by the DLTree entry
boolean	TBox.initNonPrimitive(Concept p, DLTree desc) add description to a concept; @return true in case of error
boolean	Concept.initToldSubsumers(DLTree _desc, Set<Role> RolesProcessed) init told subsumers of the concept by given DESCription; @return TRUE iff concept is CD
boolean	TBox.isIndividual(DLTree tree)
DLTree	TBox.makeNonPrimitive(Concept p, DLTree desc) make concept non-primitive; @return it's old description
DLTree	Concept.makeNonPrimitive(DLTree desc) switch primitive concept to non-primitive with new definition; @return old definition
void	TBox.processGCI(DLTree C, DLTree D) try to absorb GCI C[=D; if not possible, just record this GCI
void	Concept.push(LinkedList<DLTree> stack, DLTree current)
Concept	TBox.replaceForall(DLTree RC) replace (AR:C) with X such that C [= AR^-:X for fresh X.
static Role	Role.resolveRole(DLTree t)
void	Role.setDomain(DLTree p) add p to domain of the role
void	Role.setRange(DLTree p) add p to range of the role
boolean	TBox.switchToNonprimitive(DLTree left, DLTree right)
int	TBox.tree2dag(DLTree t)

Method parameters in uk.ac.manchester.cs.jfact.kernel with type arguments of type DLTree

Modifier and Type	Method and Description
void	Concept.addLeaves(Collection<DLTree> Desc)
void	TBox.processDifferent(List<DLTree> l)
void	TBox.processDisjoint(List<DLTree> beg) process a disjoint set [beg,end) in a usual manner
void	TBox.processDisjointC(Collection<DLTree> beg)
void	TBox.processDisjointR(List<DLTree> l)
void	TBox.processEquivalentC(List<DLTree> l)
void	TBox.processEquivalentR(List<DLTree> l)
void	TBox.processSame(List<DLTree> l)
void	Concept.push(LinkedList<DLTree> stack, DLTree current)
void	TBox.setFairnessConstraintDLTrees(List<DLTree> l)