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

Packages that use Concept

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

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 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(Stream<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)
Concept	TBox.getAuxConcept(DLTree desc)
static Concept	Concept.getBOTTOM(org.semanticweb.owlapi.model.OWLDataFactory df)
Concept	TBox.getCI(DLTree name)
static Concept	InAx.getConcept(DLTree p)
Concept	TBox.getConcept(org.semanticweb.owlapi.model.IRI name) return registered concept by given NAME;
static Concept	Concept.getQuery()
static Concept	Concept.getTEMP()
static Concept	Concept.getTOP(org.semanticweb.owlapi.model.OWLDataFactory df)
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
Stream<Concept>	TBox.getConcepts()
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)
boolean	TBox.addNonprimitiveDefinition(Concept left, Concept right, DLTree rightOrigin)
void	TBox.addSubsumeAxiom(Concept c, DLTree d) add axiom CN [= D for concept CN
void	TBox.addSubsumeForDefined(Concept c, DLTree e) add an axiom CN [= E for defined CN (CN=D already in base)
DlCompletionTree	TBox.buildCompletionTree(Concept pConcept) build a completion tree for a concept C (no caching as it breaks the idea of KE).
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)
Individual	TBox.getSPForConcept(Concept p)
DLTree	TBox.getTree(Concept c)
ModelCacheInterface	TBox.initCache(Concept pConcept, boolean sub)
boolean	TBox.isBlockedInd(Concept c)
boolean	TBox.isBlockingDet(Concept c)
boolean	TBox.isCyclic(Concept c)
static boolean	InAx.isNP(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;
void	TBox.prepareFeatures(Concept pConcept, Concept qConcept)
void	TBox.preprocessQueryConcept(Concept query) preprocess query concept: put description into DAG
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)

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