Package aterm

Examples of aterm.AFun

366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
   
    ciSub.addTrigger(trigger);
  }

  private void toELSubClassAxioms(ATermAppl axiom) {
    AFun fun = axiom.getAFun();
    ATermAppl sub = (ATermAppl) axiom.getArgument(0);
    ATermAppl sup = (ATermAppl) axiom.getArgument(1);
   
    ATermAppl subEL = ELSyntaxUtils.simplify(sub);
    if (fun.equals(ATermUtils.SUBFUN)) {
      if (ATermUtils.isPrimitive(sup) || ATermUtils.isBottom(sup)) {
        createConceptsFromAxiom(subEL, sup);
        return;
      }
     
      ATermAppl supEL = ELSyntaxUtils.simplify(sup);
      createConceptsFromAxiom(subEL, supEL);
    } else if (fun.equals( ATermUtils.EQCLASSFUN )) {
      ATermAppl supEL = ELSyntaxUtils.simplify(sup);
      createConceptsFromAxiom(subEL, supEL);
      createConceptsFromAxiom(supEL, subEL);
    } else {
      throw new IllegalArgumentException("Axiom " + axiom + " is not EL.");
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
     * TODO: Avoid processing DataOneOf when forcing into NNF
     */

    ATermAppl dnf;

    final AFun fun = term.getAFun();

    /*
     * If the term is a conjunction, each conjunct must be converted to dnf
     * and then element-wise distributed.
     */
 
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
    return true;
  }

  private boolean processClasses() {
    for( ATermAppl axiom : m_KB.getTBox().getAssertedAxioms() ) {
      AFun fun = axiom.getAFun();

      if( fun.equals( ATermUtils.DISJOINTSFUN ) ) {
        m_Expressivity.setHasDisjointClasses( true );

        ATermList args = (ATermList) axiom.getArgument( 0 );
        for( ; !args.isEmpty(); args = args.getNext() ) {
          if( !isEL( (ATermAppl) args.getFirst() ) ) {
            return false;
          }
        }
      }
      else {
        ATermAppl sub = (ATermAppl) axiom.getArgument( 0 );
        ATermAppl sup = (ATermAppl) axiom.getArgument( 1 );

        if( !isEL( sub ) || !isEL( sup ) ) {
          return false;
        }

        if( fun.equals( ATermUtils.SUBFUN ) ) {
          if( ATermUtils.isBottom( simplify( sup ) ) ) {
            m_Expressivity.setHasDisjointClasses( true );
          }
        }
        else if( fun.equals( ATermUtils.EQCLASSFUN ) ) {
          if( ATermUtils.isBottom( simplify( sub ) )
              || ATermUtils.isBottom( simplify( sup ) ) ) {
            m_Expressivity.setHasDisjointClasses( true );
          }
        }
        else if( fun.equals( ATermUtils.DISJOINTFUN ) ) {
          m_Expressivity.setHasDisjointClasses( true );
        }
        else {
          return false;
        }
View Full Code Here
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
    translateSuper(head, sup, freeVar, var);
    m_Rules.add(new Rule(head, body));
  }

  private void translateSub(List<ClauseEntry> outBody, ATermAppl sub, FreeVariableStore freeVar, Node currentVar) {
    AFun fun = sub.getAFun();
    if (ATermUtils.isPrimitive(sub) || ATermUtils.isBottom(sub)) {
      outBody.add(makeSubclassTriple(currentVar, m_Names.get(sub)));
    } else if (fun.equals( ATermUtils.ANDFUN )) {
      ATermList list = (ATermList) sub.getArgument(0);
     
      while( !list.isEmpty() ) {
        ATermAppl conj = (ATermAppl) list.getFirst();
        translateSub(outBody, conj, freeVar, currentVar);
        list = list.getNext();
      }
    } else if (fun.equals( ATermUtils.SOMEFUN )) {
      ATermAppl prop = (ATermAppl) sub.getArgument(0);
      ATermAppl q = (ATermAppl) sub.getArgument(1);
      Node nextVar = freeVar.next();
      outBody.add(makeSubOfSomeTriple(currentVar, prop, nextVar));
      translateSub(outBody, q, freeVar, nextVar);
View Full Code Here
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
      assert false;
    }
  }
 
  private void translateSuper(List<ClauseEntry> outHead, ATermAppl sup, FreeVariableStore freeVar, Node currentVar) {
    AFun fun = sup.getAFun();
    if (ATermUtils.isPrimitive(sup) || ATermUtils.isBottom(sup)) {
      outHead.add(makeSubclassTriple(currentVar, m_Names.get(sup)));
    } else if (fun.equals( ATermUtils.ANDFUN )) {
      ATermList list = (ATermList) sup.getArgument(0);
     
      while( !list.isEmpty() ) {
        ATermAppl conj = (ATermAppl) list.getFirst();
        translateSuper(outHead, conj, freeVar, currentVar);
        list = list.getNext();
      }
    } else if (fun.equals( ATermUtils.SOMEFUN )) {
      ATermAppl prop = (ATermAppl) sup.getArgument(0);
      ATermAppl q = (ATermAppl) sup.getArgument(1);
     
      if (!ATermUtils.isPrimitive(q) && !ATermUtils.isBottom(q)) {
        //Normalization - breaking complex concepts within someValues
View Full Code Here
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
      assert false;
    }
  }

  private void translateSuperSome(ATermAppl anon, ATermAppl sup) {
    AFun fun = sup.getAFun();
    if( ATermUtils.isPrimitive( sup ) || ATermUtils.isBottom( sup ) ) {
      m_Facts.add( makeSubclassFact( anon, sup ) );
    }
    else if( fun.equals( ATermUtils.ANDFUN ) ) {
      ATermList list = (ATermList) sup.getArgument( 0 );

      while( !list.isEmpty() ) {
        ATermAppl conj = (ATermAppl) list.getFirst();
        translateSuperSome( anon, conj );
        list = list.getNext();
      }
    }
    else if( fun.equals( ATermUtils.SOMEFUN ) ) {
      ATermAppl prop = (ATermAppl) sup.getArgument( 0 );
      ATermAppl q = (ATermAppl) sup.getArgument( 1 );

      if( !ATermUtils.isPrimitive( q ) && !ATermUtils.isBottom( q ) ) {
        // Normalization - breaking complex concepts within someValues
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
   
    taxonomy = new GenericTaxonomyBuilder().build( subsumers );
  }
 
  private void toELSubClassAxioms(ATermAppl axiom) {
    AFun fun = axiom.getAFun();
    ATermAppl sub = (ATermAppl) axiom.getArgument(0);
    ATermAppl sup = (ATermAppl) axiom.getArgument(1);
   
    ATermAppl subEL = ELSyntaxUtils.simplify(sub);
    if (fun.equals(ATermUtils.SUBFUN)) {
      if (ATermUtils.isPrimitive(sup) || ATermUtils.isBottom(sup)) {
        addSubclassRule(subEL, sup);
        return;
      }
     
      ATermAppl supEL = ELSyntaxUtils.simplify(sup);
      addSubclassRule(subEL, supEL);
    } else if (fun.equals( ATermUtils.EQCLASSFUN )) {
      ATermAppl supEL = ELSyntaxUtils.simplify(sup);
      addSubclassRule(subEL, supEL);
      addSubclassRule(supEL, subEL);
    } else {
      throw new IllegalArgumentException("Axiom " + axiom + " is not EL.");
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
   *
   * @param concept
   * @return
   */
  public static boolean isEL(ATermAppl concept) {
    AFun fun = concept.getAFun();

    boolean isEL = false;
    if( ATermUtils.isPrimitive( concept ) || ATermUtils.isBottom( concept ) ) {
      isEL = true;
    }
    else if( fun.equals( ATermUtils.ANDFUN ) ) {
      ATermList listEL = (ATermList) concept.getArgument( 0 );

      while( !listEL.isEmpty() ) {
        if( !isEL( (ATermAppl) listEL.getFirst() ) ) {
          break;
        }
        listEL = listEL.getNext();
      }
      isEL = listEL.isEmpty();
    }
    else if( fun.equals( ATermUtils.SOMEFUN ) ) {
      ATermAppl p = (ATermAppl) concept.getArgument( 0 );
      ATermAppl q = (ATermAppl) concept.getArgument( 1 );
      isEL = ATermUtils.isPrimitive(p) && isEL( q );
    }
    else {
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
   * @throws InternalReasonerException
   *             if the concept is not an LE class expression
   */
  public static ATermAppl simplify(ATermAppl elConcept) throws InternalReasonerException {
    ATermAppl simp = elConcept;
    AFun fun = elConcept.getAFun();
   
    if( fun.equals( ATermUtils.ANDFUN ) ) {
      ATermList conjuncts = (ATermList) elConcept.getArgument( 0 );
      Set<ATermAppl> set = CollectionUtils.makeSet();
      for( MultiListIterator i = new MultiListIterator( conjuncts ); i.hasNext(); ) {
        ATermAppl c = i.next();
        if( ATermUtils.isAnd( c ) ) {
          i.append( (ATermList) c.getArgument( 0 ) );
        }
        else if( c.equals( ATermUtils.BOTTOM ) ) {
          return ATermUtils.BOTTOM;
        }
        else if( !c.equals( ATermUtils.TOP ) ) {
          set.add( c );
        }
      }

      if( set.size() > 1 ) {
        simp = ATermUtils.makeAnd( ATermUtils.toSet( set ) );
      }
      else if( set.size() == 1 ) {
        simp = set.iterator().next();
      }
    }
    else if( fun.equals( ATermUtils.SOMEFUN ) ) {
      ATerm p = elConcept.getArgument( 0 );
      ATermAppl q = (ATermAppl) elConcept.getArgument( 1 ); // complex
      // role?
      ATermAppl qSimp = simplify( q );
      if( qSimp.equals( ATermUtils.BOTTOM ) ) {
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
  public OntBuilder(KnowledgeBase originalKB) {
    this.originalKB = originalKB;
  }

  public void add(ATermAppl axiom) {
    AFun afun = axiom.getAFun();
    if( afun.equals( ATermUtils.EQCLASSFUN ) ) {       
      ATermAppl c1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl c2 = (ATermAppl) axiom.getArgument( 1 );

      defineClass( c1 );
      defineClass( c2 );
      kb.addEquivalentClass( c1, c2 );
    }
    else if( afun.equals( ATermUtils.SUBFUN ) ) {
      ATermAppl c1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl c2 = (ATermAppl) axiom.getArgument( 1 );

      defineClass( c1 );
      defineClass( c2 );
      kb.addSubClass( c1, c2 );
    }
    else if( afun.equals( ATermUtils.DISJOINTSFUN ) ) {
      ATermList concepts = (ATermList) axiom.getArgument( 0 );
     
      for( ATermList l = concepts; !l.isEmpty(); l = l.getNext() )
        defineClass( (ATermAppl) l.getFirst() );           
      kb.addDisjointClasses( concepts );
    }
    else if( afun.equals( ATermUtils.DISJOINTFUN ) ) {
      ATermAppl c1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl c2 = (ATermAppl) axiom.getArgument( 1 );

      defineClass( c1 );
      defineClass( c2 );
      kb.addDisjointClass( c1, c2 );
    }
    else if( afun.equals( ATermUtils.DISJOINTPROPSFUN ) ) {
      ATermList props = (ATermList) axiom.getArgument( 0 );
     
      for( ATermList l = props; !l.isEmpty(); l = l.getNext() )
        defineProperty( l.getFirst() );
      kb.addDisjointProperties( props );
    }
    else if( afun.equals( ATermUtils.DISJOINTPROPFUN ) ) {
      ATermAppl p1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl p2 = (ATermAppl) axiom.getArgument( 1 );

      defineProperty( p1 );
      defineProperty( p2 );
      kb.addDisjointProperty( p1, p2 );
    }
    else if( afun.equals( ATermUtils.SUBPROPFUN ) ) {
      ATerm p1 = axiom.getArgument( 0 );
      ATermAppl p2 = (ATermAppl) axiom.getArgument( 1 );

      defineProperty( p1 );
      defineProperty( p2 );
      kb.addSubProperty( p1, p2 );
    }
    else if( afun.equals( ATermUtils.EQPROPFUN ) ) {
      ATermAppl p1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl p2 = (ATermAppl) axiom.getArgument( 1 );

      defineProperty( p1 );
      defineProperty( p2 );
      kb.addEquivalentProperty( p1, p2 );
    }
    else if( afun.equals( ATermUtils.DOMAINFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl c = (ATermAppl) axiom.getArgument( 1 );

      defineProperty( p );
      defineClass( c );
      kb.addDomain( p, c );
    }
    else if( afun.equals( ATermUtils.RANGEFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl c = (ATermAppl) axiom.getArgument( 1 );

      defineProperty( p );
      defineClass( c );
      kb.addRange( p, c );
    }
    else if( afun.equals( ATermUtils.INVPROPFUN ) ) {
      ATermAppl p1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl p2 = (ATermAppl) axiom.getArgument( 1 );

      kb.addObjectProperty( p1 );
      kb.addObjectProperty( p2 );
      kb.addInverseProperty( p1, p2 );
    }
    else if( afun.equals( ATermUtils.TRANSITIVEFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );

      kb.addObjectProperty( p );
      kb.addTransitiveProperty( p );
    }
    else if( afun.equals( ATermUtils.FUNCTIONALFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );

      defineProperty( p );
      kb.addFunctionalProperty( p );
    }
    else if( afun.equals( ATermUtils.INVFUNCTIONALFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );

      kb.addObjectProperty( p );
      kb.addInverseFunctionalProperty( p );
    }
    else if( afun.equals( ATermUtils.SYMMETRICFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );

      kb.addObjectProperty( p );
      kb.addSymmetricProperty( p );
    }
    else if( afun.equals( ATermUtils.ASYMMETRICFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );

      kb.addObjectProperty( p );
      kb.addAsymmetricProperty( p );
    }
    else if( afun.equals( ATermUtils.REFLEXIVEFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );

      kb.addObjectProperty( p );
      kb.addReflexiveProperty( p );
    }
    else if( afun.equals( ATermUtils.IRREFLEXIVEFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );

      kb.addObjectProperty( p );
      kb.addIrreflexiveProperty( p ); 
    }
    else if( afun.equals( ATermUtils.TYPEFUN ) ) {
      ATermAppl ind = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl cls = (ATermAppl) axiom.getArgument( 1 );

      kb.addIndividual( ind );
      defineClass( cls );
      kb.addType( ind, cls );
    }
    else if( afun.equals( ATermUtils.PROPFUN ) ) {
      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl s = (ATermAppl) axiom.getArgument( 1 );
      ATermAppl o = (ATermAppl) axiom.getArgument( 2 );

      kb.addIndividual( s );
      if( ATermUtils.isLiteral( o ) ) {
        kb.addDatatypeProperty( p );
      }
      else {
        kb.addObjectProperty( p );
        kb.addIndividual( o );
      }
      kb.addPropertyValue( p, s, o );
    }
    else if( afun.equals( ATermUtils.NOTFUN )
        && ((ATermAppl) axiom.getArgument( 0 )).getAFun().equals( ATermUtils.PROPFUN ) ) {
      axiom = (ATermAppl) axiom.getArgument( 0 );

      ATermAppl p = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl s = (ATermAppl) axiom.getArgument( 1 );
      ATermAppl o = (ATermAppl) axiom.getArgument( 2 );
     
      kb.addIndividual( s );
      if( ATermUtils.isLiteral( o ) ) {
        kb.addDatatypeProperty( p );
      }
      else {
        kb.addObjectProperty( p );
        kb.addIndividual( o );
      }
      kb.addNegatedPropertyValue( p, s, o );     
    }
    else if( afun.equals( ATermUtils.SAMEASFUN ) ) {
      ATermAppl ind1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl ind2 = (ATermAppl) axiom.getArgument( 1 );

      kb.addIndividual( ind1 );
      kb.addIndividual( ind2 );
      kb.addSame( ind1, ind2 );
    }
    else if( afun.equals( ATermUtils.DIFFERENTFUN ) ) {
      ATermAppl ind1 = (ATermAppl) axiom.getArgument( 0 );
      ATermAppl ind2 = (ATermAppl) axiom.getArgument( 1 );

      kb.addIndividual( ind1 );
      kb.addIndividual( ind2 );
      kb.addDifferent( ind1, ind2 );
    }
    else if( afun.equals( ATermUtils.ALLDIFFERENTFUN ) ) {
      ATermList inds = (ATermList) axiom.getArgument( 0 );
     
      for( ATermList l = inds; !l.isEmpty(); l = l.getNext() )
        kb.addIndividual( (ATermAppl) l.getFirst() );
      kb.addAllDifferent( inds );
    }
    else if( afun.equals( ATermUtils.RULEFUN ) ) {
      Set<RuleAtom> antecedent = new HashSet<RuleAtom>(); // Body
      Set<RuleAtom> consequent = new HashSet<RuleAtom>(); // Head

      ATermList head = (ATermList) axiom.getArgument( 1 );
      ATermList body = (ATermList) axiom.getArgument( 2 );
View Full Code Here
TOP

Related Classes of aterm.AFun

  • apigen.adt.Alternative
  • apigen.adt.Type
  • apigen.gen.c.CDictionaryGenerator
  • aterm.pure.AFunImpl
  • aterm.pure.ATermApplImpl
  • aterm.pure.ATermBlobImpl
  • aterm.pure.ATermImpl
  • aterm.pure.ATermIntImpl
  • aterm.pure.ATermListImpl
  • aterm.pure.ATermLongImpl
    • 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.