Uses of Class
uk.ac.manchester.cs.jfact.kernel.Concept

Packages that use Concept

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

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

Subclasses of Concept in uk.ac.manchester.cs.jfact.kernel

Modifier and Type	Class and Description
class	Individual

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

Modifier and Type	Method and Description
<T extends Concept> int	TBox.fillArrays(List<T> begin)

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

Modifier and Type	Method and Description
Concept	TBox.checkToldCycle(Concept _p)
Concept	TBox.createQueryConcept(DLTree desc)
static Concept	Concept.getBOTTOM()
Concept	TBox.getCI(DLTree name) get TOP/BOTTOM/CN/IN by the DLTree entry
Concept	TBox.getConcept(String name) return registered concept by given NAME; @return null if can't register
static Concept	Concept.getTEMP()
static Concept	Concept.getTOP()
Concept	TBox.replaceForall(DLTree RC) replace (AR:C) with X such that C [= AR^-:X for fresh X.

Methods in uk.ac.manchester.cs.jfact.kernel that return types with arguments of type Concept

Modifier and Type	Method and Description
List<Concept>	TBox.c_begin()
List<Concept>	TBox.getFairness()

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

Modifier and Type	Method and Description
void	TBox.addConceptToHeap(Concept pConcept)
void	TBox.addSubsumeAxiom(Concept C, DLTree D) add axiom CN [= D for concept CN
void	TBox.addSubsumeForDefined(Concept C, DLTree D)
void	TBox.checkEarlySynonym(Concept p) checks if C is defined as C=D and set Synonyms accordingly
Concept	TBox.checkToldCycle(Concept _p)
int	TBox.concept2dag(Concept p)
void	TBox.dumpConcept(uk.ac.manchester.cs.jfact.kernel.DumpInterface dump, Concept p)
void	LogicFeatures.fillConceptData(Concept p)
Individual	TBox.getBlockingInd(Concept C) get individual that blocks C; works only for blocked individuals C
Individual	TBox.getSPForConcept(Concept p)
DLTree	TBox.getTree(Concept C) get a DL tree by a given concept-like C
ModelCacheInterface	TBox.initCache(Concept pConcept, boolean sub)
boolean	TBox.initNonPrimitive(Concept p, DLTree desc) add description to a concept; @return true in case of error
boolean	TBox.isBlockedInd(Concept C)
boolean	TBox.isBlockingDet(Concept C)
boolean	TBox.isSatisfiable(Concept pConcept)
boolean	TBox.isSubHolds(Concept pConcept, Concept qConcept)
DLTree	TBox.makeNonPrimitive(Concept p, DLTree desc) make concept non-primitive; @return it's old description
void	TBox.prepareFeatures(Concept pConcept, Concept qConcept)
void	TBox.printConcept(LogAdapter o, Concept p)
void	TBox.setConceptIndex(Concept C) set new concept index for given C wrt existing nC
void	Concept.setToldTop(Concept top) init TOP told subsumer if necessary
ModelCacheState	TBox.testCachedNonSubsumption(Concept p, Concept q) test if 2 concept non-subsumption can be determined by cache merging
boolean	TBox.testSortedNonSubsumption(Concept p, Concept q) test if 2 concept non-subsumption can be determined by sorts checking

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

Modifier and Type	Method and Description
void	TBox.classifyConcepts(List<Concept> collection, boolean curCompletelyDefined, String type)
void	TBox.initRuleFields(List<Concept> v, int index) init Extra Rule field in concepts given by a vector V with a given INDEX

Constructors in uk.ac.manchester.cs.jfact.kernel with parameters of type Concept

Constructor and Description
DLConceptTaxonomy(Concept pTop, Concept pBottom, TBox kb) the only c'tor

Uses of Concept in uk.ac.manchester.cs.jfact.split

Fields in uk.ac.manchester.cs.jfact.split declared as Concept

Modifier and Type	Field and Description
Concept	TSplitVar.C
Concept	TSplitVar.Entry.concept