Package org.ggp.base.util.propnet.architecture.components

Examples of org.ggp.base.util.propnet.architecture.components.Proposition

148
149
150
151
152
153
154
155
156
157
158
    // based on having the same Body proposition.
    for(Set<Proposition> legalProps : legalPropositions.values()) {
      for(Proposition legalProp : legalProps) {
        List<GdlTerm> legalPropBody = (legalProp.getName()).getBody();
        if (inputPropsByBody.containsKey(legalPropBody)) {
            Proposition inputProp = inputPropsByBody.get(legalPropBody);
            legalInputMap.put(inputProp, legalProp);
            legalInputMap.put(legalProp, inputProp);
        }
      }
    }
View Full Code Here
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
  public void removeComponent(Component c) {


    //Go through all the collections it could appear in
    if(c instanceof Proposition) {
      Proposition p = (Proposition) c;
      GdlSentence name = p.getName();
      if(basePropositions.containsKey(name)) {
        basePropositions.remove(name);
      } else if(inputPropositions.containsKey(name)) {
        inputPropositions.remove(name);
        //The map goes both ways...
        Proposition partner = legalInputMap.get(p);
        if(partner != null) {
          legalInputMap.remove(partner);
          legalInputMap.remove(p);
        }
      } else if(name == GdlPool.getProposition(GdlPool.getConstant("INIT"))) {
        throw new RuntimeException("The INIT component cannot be removed. Consider leaving it and ignoring it.");
      } else if(name == GdlPool.getProposition(GdlPool.getConstant("terminal"))) {
        throw new RuntimeException("The terminal component cannot be removed.");
      } else {
        for(Set<Proposition> propositions : legalPropositions.values()) {
          if(propositions.contains(p)) {
            propositions.remove(p);
            Proposition partner = legalInputMap.get(p);
            if(partner != null) {
              legalInputMap.remove(partner);
              legalInputMap.remove(p);
            }
          }
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
  {
    if ( literal instanceof GdlDistinct )
    {
      GdlDistinct distinct = (GdlDistinct) literal;

      Proposition proposition = new Proposition(GdlPool.getProposition(GdlPool.getConstant("anon")));
      Constant constant = new Constant(!distinct.getArg1().equals(distinct.getArg2()));

      link(constant, proposition);

      components.add(proposition);
      components.add(constant);

      return proposition;
    }
    else if ( literal instanceof GdlNot )
    {
      GdlNot not = (GdlNot) literal;

      Proposition input = convertConjunct(not.getBody());
      Not no = new Not();
      Proposition output = new Proposition(GdlPool.getProposition(GdlPool.getConstant("anon")));

      link(input, no);
      link(no, output);

      components.add(input);
      components.add(no);
      components.add(output);

      return output;
    }
    else
    {
      GdlSentence sentence = (GdlSentence) literal;

      Proposition proposition = getProposition(sentence);
      components.add(proposition);

      return proposition;
    }
  }
View Full Code Here
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
   */
  private Proposition convertHead(GdlSentence sentence)
  {
    if ( sentence.getName().getValue().equals("next") )
    {
      Proposition head = getProposition(GdlPool.getRelation(GdlPool.getConstant("true"),
                                                            sentence.getBody()));
      Transition transition = new Transition();
      Proposition preTransition = new Proposition(GdlPool.getProposition(GdlPool.getConstant("anon")));

      link(preTransition, transition);
      link(transition, head);

      components.add(head);
      components.add(transition);
      components.add(preTransition);

      return preTransition;
    }
    else
    {
      Proposition proposition = getProposition(sentence);
      components.add(proposition);

      return proposition;
    }
  }
View Full Code Here
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
   * @param rule
   *            The rule to convert.
   */
  private void convertRule(GdlRule rule)
  {
    Proposition head = convertHead(rule.getHead());
    And and = new And();

    link(and, head);

    components.add(head);
    components.add(and);

    for ( GdlLiteral literal : rule.getBody() )
    {
      Proposition conjunct = convertConjunct(literal);
      link(conjunct, and);
    }
  }
View Full Code Here
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
   */
  private void convertStatic(GdlSentence sentence)
  {
    if ( sentence.getName().getValue().equals("init") )
    {
      Proposition init = getProposition(GdlPool.getProposition(GdlPool.getConstant("INIT")));
      Transition transition = new Transition();
      Proposition proposition = getProposition(GdlPool.getRelation(GdlPool.getConstant("true"),
                                                                   sentence.getBody()));

      link(init, transition);
      link(transition, proposition);

      components.add(init);
      components.add(transition);
      components.add(proposition);
    }

    Constant constant = new Constant(true);
    Proposition proposition = getProposition(sentence);

    link(constant, proposition);

    components.add(constant);
    components.add(proposition);
View Full Code Here
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
      int i = 0;
      for ( Component input : fixItem.getInputs() )
      {
          i++;

        Proposition disjunct = null;
        if ( fixItem.getName() instanceof GdlProposition )
        {
          GdlProposition proposition = (GdlProposition) fixItem.getName();
          disjunct = new Proposition(GdlPool.getProposition(GdlPool.getConstant(proposition.getName().getValue() + "-" + i)));
        }
        else
        {
          GdlRelation relation = (GdlRelation) fixItem.getName();
          disjunct = new Proposition(GdlPool.getRelation(GdlPool.getConstant(relation.getName().getValue() + "-" + i), relation.getBody()));
        }

        input.getOutputs().clear();

        link(input, disjunct);
View Full Code Here
306
307
308
309
310
311
312
313
314
   */
  private Proposition getProposition(GdlSentence sentence)
  {
    if ( !propositions.containsKey(sentence) )
    {
      propositions.put(sentence, new Proposition(sentence));
    }
    return propositions.get(sentence);
  }
View Full Code Here
185
186
187
188
189
190
191
192
193
194
195
196
        if(form.getName().equals(LEGAL)
            || form.getName().equals(GOAL)
            || form.getName().equals(INIT)) {
          //Add it
          for (GdlSentence trueSentence : constantChecker.getTrueSentences(form)) {
            Proposition trueProp = new Proposition(trueSentence);
            trueProp.addInput(trueComponent);
            trueComponent.addOutput(trueProp);
            components.put(trueSentence, trueComponent);
          }
        }
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
   * @param componentSet
   */
  private static void normalizePropositions(Set<Component> componentSet) {
    for(Component component : componentSet) {
      if(component instanceof Proposition) {
        Proposition p = (Proposition) component;
        GdlSentence sentence = p.getName();
        if(sentence instanceof GdlRelation) {
          GdlRelation relation = (GdlRelation) sentence;
          if(relation.getName().equals(NEXT)) {
            p.setName(GdlPool.getProposition(GdlPool.getConstant("anon")));
          }
        }
      }
    }
  }
View Full Code Here
TOP

Related Classes of org.ggp.base.util.propnet.architecture.components.Proposition

  • org.ggp.base.util.propnet.architecture.PropNet
  • org.ggp.base.util.propnet.factory.converter.PropNetConverter
  • org.ggp.base.util.propnet.factory.OptimizingPropNetFactory
    • 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.