Package aterm

Examples of aterm.ATermList


    ConceptInfo concept = concepts.get( c );
    if( concept == null ) {
      concept = new ConceptInfo( c, hasComplexRoles, false );
     
      if( ATermUtils.isAnd( c ) ) {
        ATermList list = (ATermList) c.getArgument(0);
        for( ; !list.isEmpty(); list = list.getNext() ) {
          ATermAppl conj = (ATermAppl) list.getFirst();
         
          ConceptInfo conjConcept = createConcept( conj );
          addToQueue( concept, conjConcept );
         
          conjunctions.add( conjConcept, concept )
View Full Code Here


  private void processAxiom(ATermAppl axiom) {
    AFun fun = axiom.getAFun();

    if( fun.equals( ATermUtils.DISJOINTSFUN ) ) {
      ATermList concepts = (ATermList) axiom.getArgument( 0 );
      int n = concepts.getLength();
      ATermAppl[] simplified = new ATermAppl[n];
      for( int i = 0; !concepts.isEmpty(); concepts = concepts.getNext(), i++ ) {
        simplified[i] = ELSyntaxUtils.simplify( (ATermAppl) concepts.getFirst() );
      }
      for( int i = 0; i < n - 1; i++ ) {
        for( int j = i + 1; j < n; j++ ) {
          createDisjointAxiom( simplified[i], simplified[j] );
        }
View Full Code Here

    if( log.isLoggable( Level.FINEST ) )
      log.finest( "+++ Cache sat concept " + c );

    if( ATermUtils.isAnd( c ) ) {
      ATermList list = (ATermList) c.getArgument( 0 );
      for( ; !list.isEmpty(); list = list.getNext() ) {
        addCacheSat( (ATermAppl) list.getFirst() );
      }
    }
  }
View Full Code Here

      return sat;

    sat = null;

    // try to find the satisfiability of an intersection by inspecting the elements inside the conjunction
    ATermList list = (ATermList) c.getArgument(0);
    CachedNode cached1 = null;
    CachedNode cached2 = null;
    for (; !list.isEmpty(); list = list.getNext()) {
      ATermAppl d = (ATermAppl) list.getFirst();
      CachedNode node = abox.getCached(d);

      if (node == null || !node.isComplete()) {
        // we don't have complete sat info about an element so give up
        sat = Bool.UNKNOWN;
View Full Code Here

      desc.accept( this );
      terms[size++] = term;
    }
    // create a sorted set of terms so we will have a stable
    // concept creation and removal using this concept will work
    ATermList setOfTerms = size > 0
      ? ATermUtils.toSet( terms, size )
      : ATermUtils.EMPTY_LIST;
    term = ATermUtils.makeAnd( setOfTerms );
  }
View Full Code Here

      desc.accept( this );
      terms[size++] = term;
    }
    // create a sorted set of terms so we will have a stable
    // concept creation and removal using this concept will work
    ATermList setOfTerms = size > 0
      ? ATermUtils.toSet( terms, size )
      : ATermUtils.EMPTY_LIST;
    term = ATermUtils.makeOr( setOfTerms );
  }
View Full Code Here

      ind.accept( this );
      terms[size++] = ATermUtils.makeValue( term );
    }
    // create a sorted set of terms so we will have a stable
    // concept creation and removal using this concept will work
    ATermList setOfTerms = size > 0
      ? ATermUtils.toSet( terms, size )
      : ATermUtils.EMPTY_LIST;
    term = ATermUtils.makeOr( setOfTerms );
  }
View Full Code Here

      for( OWLClassExpression desc : descriptions ) {
        desc.accept( this );
        terms[index++] = term;
      }

      ATermList list = ATermUtils.toSet( terms, size );
      if( addAxioms ) {
        kb.addDisjointClasses( list );
      }
      else {
        reloadRequired = !kb.removeAxiom( ATermUtils.makeDisjoints( list ) );
View Full Code Here

    kb.addKey( c, properties );
  }

 
  public void visit(OWLDataOneOf enumeration) {
    ATermList ops = ATermUtils.EMPTY_LIST;
    for( OWLLiteral value : enumeration.getValues() ) {
      value.accept( this );
      ops = ops.insert( ATermUtils.makeValue( result() ) );
    }
    term = ATermUtils.makeOr( ops );
  }
View Full Code Here

    axiom.getSuperProperty().accept( this );
    ATermAppl prop = result();

    List<OWLObjectPropertyExpression> propChain = axiom.getPropertyChain();
    ATermList chain = ATermUtils.EMPTY_LIST;
    for( int i = propChain.size() - 1; i >= 0; i-- ) {
      propChain.get( i ).accept( this );
      chain = chain.insert( result() );
    }

    kb.addSubProperty( chain, prop );
  }
View Full Code Here

TOP

Related Classes of aterm.ATermList

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.