Package org.mindswap.pellet.utils.iterator

Examples of org.mindswap.pellet.utils.iterator.MultiListIterator

75
76
77
78
79
80
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
123
124
125
126
127
128
129
130
131
132
133
134
135
       * After this step, <code>conjuncts</code> is the flattened list of
       * conjuncts, each in DNF
       */
      ATermList rootConjuncts = (ATermList) term.getArgument( 0 );
      List<ATermAppl> conjuncts = new ArrayList<ATermAppl>();
      MultiListIterator i = new MultiListIterator( rootConjuncts );
      while( i.hasNext() ) {
        ATermAppl a = i.next();
        if( isAnd( a ) )
          i.append( (ATermList) a.getArgument( 0 ) );
        else {
          ATermAppl dnfA = dnfFromNnf( a );
          conjuncts.add( dnfA );
        }
      }

      /*
       * Step 2: element-wise distribute any disjunction among the
       * conjuncts.
       */
      List<ATermAppl> disjuncts = new ArrayList<ATermAppl>();
      for( ATermAppl a : conjuncts ) {
        if( disjuncts.isEmpty() ) {
          addToList( a, isOr( a ), disjuncts );
        }
        else {
          List<ATermAppl> thisArgs = new ArrayList<ATermAppl>();
          List<ATermAppl> newDisjuncts = new ArrayList<ATermAppl>();
          addToList( a, isOr( a ), thisArgs );

          for( ATermAppl a1 : thisArgs ) {
            for( ATermAppl b : disjuncts ) {
              List<ATermAppl> list = new ArrayList<ATermAppl>();
              addToList( a1, isAnd( a1 ), list );
              addToList( b, isAnd( b ), list );             
              newDisjuncts.add( makeAnd( toSet( list ) ) );
            }
          }
          disjuncts = newDisjuncts;
        }
      }

      dnf = makeOr( toSet( disjuncts ) );

    }
    /*
     * If the term is a disjunction merge each element into DNF
     */
    else if( ORFUN.equals( fun ) ) {
      ATermList disjuncts = (ATermList) term.getArgument( 0 );
      MultiListIterator i = new MultiListIterator( disjuncts );
      List<ATermAppl> args = new ArrayList<ATermAppl>();
      while( i.hasNext() ) {
        ATermAppl a = i.next();
        if( isOr( a ) )
          i.append( (ATermList) a.getArgument( 0 ) );
        else
          args.add( dnfFromNnf( a ) );
      }
      dnf = makeOr( toSet( args ) );
    }
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
104
105
106
    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 ) ) {
View Full Code Here
738
739
740
741
742
743
744
745
746
747
748
//            }

            boolean equivalent = axiom.getAFun().equals( ATermUtils.EQCLASSFUN );
            if( equivalent ) {
              Iterator<ATermAppl> i = ATermUtils.isAnd( term )
                ? new MultiListIterator( (ATermList) term.getArgument( 0 ) )
                : Collections.singleton( term ).iterator();
              Bool knownType = Bool.TRUE;
              while( i.hasNext() && knownType.isTrue() ) {
                term = i.next();
                knownType = isKnownType( pNode, term, SetUtils.<ATermAppl>emptySet() );
View Full Code Here
404
405
406
407
408
409
410
411
412
413
414
    }
   
    public Iterator<ATermAppl> getNominals(ATermAppl term) {
      if( isOneOf( term ) ) {
        ATermList list = (ATermList) term.getArgument( 0 );
        return new MultiListIterator( list );
      }
      else if( isNominal( term ) ) {
        return IteratorUtils.singletonIterator( term );
      }
     
View Full Code Here
738
739
740
741
742
743
744
745
746
747
748
//            }

            boolean equivalent = axiom.getAFun().equals( ATermUtils.EQCLASSFUN );
            if( equivalent ) {
              Iterator<ATermAppl> i = ATermUtils.isAnd( term )
                ? new MultiListIterator( (ATermList) term.getArgument( 0 ) )
                : Collections.singleton( term ).iterator();
              Bool knownType = Bool.TRUE;
              while( i.hasNext() && knownType.isTrue() ) {
                term = i.next();
                knownType = isKnownType( pNode, term, SetUtils.<ATermAppl>emptySet() );
View Full Code Here
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
              simp = TOP;
            }
            else {
        Set<ATermAppl> set = new HashSet<ATermAppl>();
        List<ATermAppl> negations = new ArrayList<ATermAppl>();
        MultiListIterator i = new MultiListIterator( conjuncts );
        while( i.hasNext() ) {
          ATermAppl c = i.next();
          if( c.equals( TOP ) ) {
                      continue;
                    }
                    else if( c.equals( BOTTOM ) ) {
                      return BOTTOM;
                    }
                    else if( isAnd( c ) ) {
                      i.append( (ATermList) c.getArgument( 0 ) );
                    }
                    else if( isNot( c ) ) {
                      negations.add( c );
                    }
                    else {
View Full Code Here
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
   * @return
   */
  public static ATermAppl makeSimplifiedAnd(Collection<ATermAppl> conjuncts) {
    Set<ATermAppl> set = new HashSet<ATermAppl>();
    List<ATermAppl> negations = new ArrayList<ATermAppl>();
    MultiListIterator listIt = new MultiListIterator( EMPTY_LIST );
    Iterator<ATermAppl> i = new PairIterator<ATermAppl>( conjuncts.iterator(), listIt );
    while( i.hasNext() ) {
      ATermAppl c = i.next();
      if( c.equals( TOP ) ) {
              continue;
            }
            else if( c.equals( BOTTOM ) ) {
              return BOTTOM;
            }
            else if( isAnd( c ) ) {
              listIt.append( (ATermList) c.getArgument( 0 ) );
            }
            else if( isNot( c ) ) {
              negations.add( c );
            }
            else {
View Full Code Here
TOP

Related Classes of org.mindswap.pellet.utils.iterator.MultiListIterator

  • aterm.ATermAppl
  • com.clarkparsia.pellet.datatypes.DNF
  • com.clarkparsia.pellet.el.ELSyntaxUtils
  • org.mindswap.pellet.ABox
  • org.mindswap.pellet.tbox.impl.TBoxImpl$OneOfAbsorption
  • org.mindswap.pellet.utils.ATermUtils
  • java.util.NoSuchElementException
    • 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.