Package com.hp.hpl.jena.ontology

Examples of com.hp.hpl.jena.ontology.OntClass

77
78
79
80
81
82
83
84
85
86
87
    // recurse to the next level down
    if (cls.canAs( OntClass.class )  &&  !occurs.contains( cls )) {
      //list subclasses
      for (Iterator i = cls.listSubClasses( true );  i.hasNext(); ) {
        OntClass sub = (OntClass) i.next();

        // we push this expression on the occurs list before we recurse
        occurs.add( cls );
        parseClass(sub, occurs, depth+1);
        occurs.remove( cls );
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
  public Iterator rootClasses( OntModel m ) {
    List roots = new ArrayList();
   
    for (Iterator i = m.listClasses();  i.hasNext(); ) {
      OntClass c = (OntClass) i.next();
       
      try {
      // too confusing to list all the restrictions as root classes
        if (c.isAnon()) {
          continue;
        }
   
        if (c.hasSuperClass( m.getProfile().THING(), true ) ) {
          // this class is directly descended from Thing
          roots.add( c );
        } else if (c.getCardinality( m.getProfile().SUB_CLASS_OF() ) == 0 ) {
          // this class has no super-classes
          // (can occur if we're not using the reasoner)
          roots.add( c );
        }
      } catch (Exception e) {
View Full Code Here
202
203
204
205
206
207
208
209
210
211
212
213
214
        }
      } else if (resource instanceof OntClass) {
        //list equivalent classes
        for (Iterator i=((OntClass)resource).listEquivalentClasses();
          i.hasNext();) {
          OntClass equivClass = (OntClass) i.next();
          //add labels
          for (Iterator j=equivClass.listLabels(null); j.hasNext();) {
            Literal l = (Literal) j.next();
            synonyms.put(l.toString(), "1");
          }
        }
      }
View Full Code Here
240
241
242
243
244
245
246
247
248
249
250
    out.println();
 
    // recurse to the next level down
    if (cls.canAs( OntClass.class ) && !occurs.contains( cls )) {
      for (Iterator i = cls.listSubClasses( true ); i.hasNext(); ) {
        OntClass sub = (OntClass) i.next();

        // we push this expression on the occurs list before we recurse
        occurs.add( cls );
        renderHierarchy( out, sub, occurs, depth + 1 );
        occurs.remove( cls );
View Full Code Here
337
338
339
340
341
342
343
344
345
346
347
   
    for (Iterator i = getParser().rootClasses( getModel() );
      i.hasNext(); ) {
   
      //print class
      OntClass c = (OntClass) i.next();

      renderHierarchy(System.out, c, new LinkedList(), 0);
    }

    String[] terms =
View Full Code Here
28
29
30
31
32
33
34
35
36
37
38
39
40
41
  /**
   * parse owl ontology files using jena
   */
  public void parse(OntModel m) {
    for (Iterator i = rootClasses( m );  i.hasNext();  ) {
      OntClass c = (OntClass) i.next();

      //dont deal with anonymous classes
      if (c.isAnon()) {
        continue;
      }

      parseClass( c,  new ArrayList(), 0 );
    }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
    // recurse to the next level down
    if (cls.canAs( OntClass.class )  &&  !occurs.contains( cls )) {
      //list subclasses
      for (Iterator i = cls.listSubClasses( true );  i.hasNext(); ) {
        OntClass sub = (OntClass) i.next();

        // we push this expression on the occurs list before we recurse
        occurs.add( cls );
        parseClass(sub, occurs, depth+1);
        occurs.remove( cls );
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
  public Iterator rootClasses( OntModel m ) {
    List roots = new ArrayList();
   
    for (Iterator i = m.listClasses();  i.hasNext(); ) {
      OntClass c = (OntClass) i.next();
       
      try {
      // too confusing to list all the restrictions as root classes
        if (c.isAnon()) {
          continue;
        }
   
        if (c.hasSuperClass( m.getProfile().THING(), true ) ) {
          // this class is directly descended from Thing
          roots.add( c );
        } else if (c.getCardinality( m.getProfile().SUB_CLASS_OF() ) == 0 ) {
          // this class has no super-classes
          // (can occur if we're not using the reasoner)
          roots.add( c );
        }
      } catch (Exception e) {
View Full Code Here
190
191
192
193
194
195
196
197
198
199
200
201
202
        }
      } else if (resource instanceof OntClass) {
        //list equivalent classes
        for (Iterator i=((OntClass)resource).listEquivalentClasses();
          i.hasNext();) {
          OntClass equivClass = (OntClass) i.next();
          //add labels
          for (Iterator j=equivClass.listLabels(null); j.hasNext();) {
            Literal l = (Literal) j.next();
            synonyms.put(l.toString(), "1");
          }
        }
      }
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
    out.println();
 
    // recurse to the next level down
    if (cls.canAs( OntClass.class ) && !occurs.contains( cls )) {
      for (Iterator i = cls.listSubClasses( true ); i.hasNext(); ) {
        OntClass sub = (OntClass) i.next();

        // we push this expression on the occurs list before we recurse
        occurs.add( cls );
        renderHierarchy( out, sub, occurs, depth + 1 );
        occurs.remove( cls );
View Full Code Here
TOP

Related Classes of com.hp.hpl.jena.ontology.OntClass

  • br.uniriotec.orion.control.ForteDataGenerator
  • br.uniriotec.orion.control.OntologyParser
  • com.clarkparsia.pellet.test.query.TestSingleSPARQLDLQueries
  • com.clarkparsia.pellet.test.rbox.PropertyChainTests
  • com.esri.ontology.service.control.OntologyProcessor
  • com.hp.gloze.www_w3_org_2001_XMLSchema.element
  • com.hp.gloze.www_w3_org_2001_XMLSchema.list
  • com.hp.gloze.www_w3_org_2001_XMLSchema.restriction
  • com.hp.gloze.www_w3_org_2001_XMLSchema.schema
  • com.hp.hpl.jena.ontology.impl.TestOntTools
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.