Â¥Ö÷

[ÇóÖú]JenaÈçºÎ×¥³öSubClass Õˆ†–¸÷λ´ó´ó: ™n°¸×xÈëáá, FileInputStream file=new FileInputStream("ontologytree.owl");       InputStreamReader is=new InputStreamReader(file);        Model model=ModelFactory.createDefaultModel();        model.read(is,null);        ½ÓÏÂÈçºÎ×¥³öij‚€"a"µÄsubclass??    Êղؠ  ·ÖÏí   ¶¥(0)

	µÚ2Â¥

getSubClass OntClass getSubClass()Answer a class that is the sub-class of this class. If there is more than one such class, an arbitrary selection is made. If there is no such class, return null. Returns: A sub-class of this class or null Throws: OntProfileException - If the Profile.SUB_CLASS_OF() property is not supported in the current language profile. -------------------------------------------------------------------------------- listSubClasses ExtendedIterator listSubClasses()Answer an iterator over all of the classes that are declared to be sub-classes of this class. Each element of the iterator will be an OntClass. Returns: An iterator over the sub-classes of this class. Throws: OntProfileException - If the Profile.SUB_CLASS_OF() property is not supported in the current language profile. -------------------------------------------------------------------------------- listSubClasses ExtendedIterator listSubClasses(boolean direct)Answer an iterator over the classes that are declared to be sub-classes of this class. Each element of the iterator will be an OntClass. The distinguishing extra parameter for this method is the flag direct that allows some selectivity over the classes that appear in the iterator. Consider the following scenario:    :B rdfs:subClassOf :A.    :C rdfs:subClassOf :A.    :D rdfs:subClassof :C. (so A has two sub-classes, B and C, and C has sub-class D). In a raw model, with no inference support, listing the sub-classes of A will answer B and C. In an inferencing model, rdfs:subClassOf is known to be transitive, so the sub-classes iterator will include D. The direct sub-classes are those members of the closure of the subClassOf relation, restricted to classes that cannot be reached by a longer route, i.e. the ones that are directly adjacent to the given root. Thus, the direct sub-classes of A are B and C only, and not D - even in an inferencing graph. Note that this is not the same as the entailments from the raw graph. Suppose we add to this example:    :D rdfs:subClassof :A. Now, in the raw graph, A has sub-class C. But the direct sub-classes of A remain B and C, since there is a longer path A-C-D that means that D is not a direct sub-class of A. The assertion in the raw graph that A has sub-class D is essentially redundant, since this can be inferred from the closure of the graph. Note: This is is a change from the behaviour of Jena 1, which took a parameter closed to compute the closure over transitivity and equivalence of sub-classes. The closure capability in Jena2 is determined by the inference engine that is wrapped with the ontology model. The direct parameter is provided to allow, for exmaple, a level-by-level traversal of the class hierarchy, starting at some given root. Observe that in Jena 1, passing true will tend to increase the number of results returned; in Jena 2 passing true will tend to reduce the number of results. Parameters: direct - If true, only answer the direcly adjacent classes in the sub-class relation: i.e. eliminate any class for which there is a longer route to reach that child under the sub-class relation. Returns: an iterator over the resources representing this class's sub-classes Throws: OntProfileException - If the Profile.SUB_CLASS_OF() property is not supported in the current language profile.

	µÚ3Â¥

ÖxÖx´ó´ó,µ«´ó´ó²»ºÃÒâ˼!! ¿ÉÒÔŒ‘‚€¹ Àý¿´Ò»ÏÂÔõüNÓÃ?? Òòžé„‚„‚²éAPI,²»ÖªµÀÔõüN½ÓÊÕ"a"ß@‚€Öµ È»áá½ÓÊÕááÔÙÈ¥×¥ß@‚€ÖµµÄsubclass

	µÚ4Â¥

Thus, in our example ontology, we can print a list the subclasses of Camera as follows: OntClass camera = m.getOntClass( camNS + "Camera" ); for (Iterator i = camera.listSubClasses(); i.hasNext(); ) {   OntClass c = (OntClass) i.next();   System.out.print( c.getLocalName() + " " ); }

	µÚ5Â¥

¸ÐÖx´ó´ó!!Òѽâ›Q

	µÚ6Â¥

ºÃ£¬Ñ§Ï°ing