Package org.ggp.base.util.gdl.grammar

Examples of org.ggp.base.util.gdl.grammar.GdlOr.arity()

495
496
497
498
499
500
501
502
503
504
505
      GdlOr or = (GdlOr) literal;
      if(or.arity() == 0)
        return;
      LinkedList<GdlVariable> vars = new LinkedList<GdlVariable>();
      getSupportedVariablesInLiteral(or.get(0), vars);
      for(int i = 1; i < or.arity(); i++) {
        Set<GdlVariable> newVars = new HashSet<GdlVariable>();
        getSupportedVariablesInLiteral(or.get(i), newVars);
        vars.retainAll(newVars);
      }
      variables.addAll(vars);
View Full Code Here
592
593
594
595
596
597
598
599
600
601
602
      sentences.add((GdlSentence) literal);
    } else if(literal instanceof GdlNot) {
      getSentencesInLiteral(((GdlNot) literal).getBody(), sentences);
    } else if(literal instanceof GdlOr) {
      GdlOr or = (GdlOr) literal;
      for(int i = 0; i < or.arity(); i++) {
        getSentencesInLiteral(or.get(i), sentences);
      }
    }
  }
  private static List<GdlFunction> getFunctionsInSentence(GdlSentence sentence) {
View Full Code Here
623
624
625
626
627
628
629
630
631
632
633
      GdlNot not = (GdlNot) literal;
      if(!(not.getBody() instanceof GdlSentence))
        throw new ValidatorException("The negation " + not + " contains a literal " + not.getBody() + " that is not a sentence. Only a single sentence is allowed inside a negation.");
    } else if(literal instanceof GdlOr) {
      GdlOr or = (GdlOr) literal;
      for(int i = 0; i < or.arity(); i++) {
        testLiteralForImproperNegation(or.get(i));
      }
    }
  }
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
      return !satisfiesSentence(assignment, (GdlSentence) body, sentencesSoFar);
    } else if (literal instanceof GdlDistinct) {
      return satisfiesDistinct(assignment, (GdlDistinct) literal);
    } else if (literal instanceof GdlOr) {
      GdlOr or = (GdlOr) literal;
      for (int i = 0; i < or.arity(); i++) {
        GdlLiteral innerLiteral = or.get(i);
        if (satisfies(assignment, innerLiteral, sentencesSoFar)) {
          return true;
        }
      }
View Full Code Here
299
300
301
302
303
304
305
306
307
308
309
          acyclicRelations.add(relation);
        }
      } else if(literal instanceof GdlOr) {
        //We'll look one layer deep for the cyclic kind
        GdlOr or = (GdlOr) literal;
        for(int i = 0; i < or.arity(); i++) {
          GdlLiteral internal = or.get(i);
          if(internal instanceof GdlRelation) {
            GdlRelation relation = (GdlRelation) internal;
            if(ancestorsGraph.get(relation.getName()).contains(head)) {
              cyclicRelations.add(relation);
View Full Code Here
442
443
444
445
446
447
448
449
450
451
452
    } else if(literal instanceof GdlNot) {
      addLiteralAsDependent(((GdlNot) literal).getBody(), dependencies, negativeEdges);
      addLiteralAsDependent(((GdlNot) literal).getBody(), negativeEdges, negativeEdges);
    } else if(literal instanceof GdlOr) {
      GdlOr or = (GdlOr) literal;
      for(int i = 0; i < or.arity(); i++) {
        addLiteralAsDependent(or.get(i), dependencies, negativeEdges);
      }
    }
  }
View Full Code Here
474
475
476
477
478
479
480
481
482
483
484
      if(internal instanceof GdlRelation) {
        getVariablesInBody(((GdlRelation) internal).getBody(), unsupportedVariables);
      }
    } else if(literal instanceof GdlOr) {
      GdlOr or = (GdlOr) literal;
      for(int i = 0; i < or.arity(); i++) {
        getUnsupportedVariablesInLiteral(or.get(i), unsupportedVariables);
      }
    } else if(literal instanceof GdlDistinct) {
      GdlDistinct distinct = (GdlDistinct) literal;
      List<GdlTerm> pair = new ArrayList<GdlTerm>(2); //Easy way to parse functions
View Full Code Here
491
492
493
494
495
496
497
498
499
500
501
      Collection<GdlVariable> variables) {
    if(literal instanceof GdlRelation) {
      getVariablesInBody(((GdlRelation) literal).getBody(), variables);
    } else if(literal instanceof GdlOr) {
      GdlOr or = (GdlOr) literal;
      if(or.arity() == 0)
        return;
      LinkedList<GdlVariable> vars = new LinkedList<GdlVariable>();
      getSupportedVariablesInLiteral(or.get(0), vars);
      for(int i = 1; i < or.arity(); i++) {
        Set<GdlVariable> newVars = new HashSet<GdlVariable>();
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
    } else if(literal instanceof GdlNot) {
      GdlNot not = (GdlNot) literal;
      addSentencesInLiteral(not.getBody(), sentences);
    } else if(literal instanceof GdlOr) {
      GdlOr or = (GdlOr) literal;
      for(int i = 0; i < or.arity(); i++)
        addSentencesInLiteral(or.get(i), sentences);
    } else if(!(literal instanceof GdlDistinct)) {
      throw new RuntimeException("Unexpected GdlLiteral type encountered: " + literal.getClass().getSimpleName());
    }
  }
View Full Code Here
285
286
287
288
289
290
291
292
293
294
295
            processGdl(not.getBody(), null);
        }
        else if(gdl instanceof GdlOr)
        {
            GdlOr or = (GdlOr)gdl;
            for(int i=0; i<or.arity(); i++)
                processGdl(or.get(i), null);
        }
        else if(gdl instanceof GdlProposition)
        {
            //IGNORE
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.