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

Examples of org.ggp.base.util.gdl.grammar.GdlConstant

63
64
65
66
67
68
69
70
71
72
73
    {
      return function;
    }
    else
    {
      GdlConstant name = substituteConstant(function.getName(), theta);

      List<GdlTerm> body = new ArrayList<GdlTerm>();
      for (int i = 0; i < function.arity(); i++)
      {
        body.add(substituteTerm(function.get(i), theta));
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
    {
      return relation;
    }
    else
    {
      GdlConstant name = substituteConstant(relation.getName(), theta);

      List<GdlTerm> body = new ArrayList<GdlTerm>();
      for (int i = 0; i < relation.arity(); i++)
      {
        body.add(substituteTerm(relation.get(i), theta));
View Full Code Here
95
96
97
98
99
100
101
102
103
104
105
    SymbolList arg3 = (SymbolList) list.get(3);
    SymbolAtom arg4 = (SymbolAtom) list.get(4);
    SymbolAtom arg5 = (SymbolAtom) list.get(5);

    String matchId = arg1.getValue();
    GdlConstant roleName = (GdlConstant) GdlFactory.createTerm(arg2);
    String theRulesheet = arg3.toString();
    int startClock = Integer.valueOf(arg4.getValue());
    int playClock = Integer.valueOf(arg5.getValue());

    // For now, there are only five standard arguments. If there are any
View Full Code Here
29
30
31
32
33
34
35
36
37
38
39
40
    public void testProverOnTicTacToe() throws Exception {
        List<Gdl> ticTacToeDesc = new TestGameRepository().getGame("ticTacToe").getRules();
        sm.initialize(ticTacToeDesc);
        MachineState state = sm.getInitialState();
        assertFalse(sm.isTerminal(state));
        GdlConstant X_PLAYER = GdlPool.getConstant("xplayer");
        GdlConstant O_PLAYER = GdlPool.getConstant("oplayer");
        Role xRole = new Role(X_PLAYER);
        Role oRole = new Role(O_PLAYER);
        List<Role> roles = Arrays.asList(xRole, oRole);
        assertEquals(roles, sm.getRoles());
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
        assertEquals(Collections.singletonList(100), sm.getGoals(state));
    }

    protected Move move(String description) {
        String[] parts = description.split(" ");
        GdlConstant head = GdlPool.getConstant(parts[0]);
        if(parts.length == 1)
            return new Move(head);
        List<GdlTerm> body = new ArrayList<GdlTerm>();
        for(int i = 1; i < parts.length; i++) {
            body.add(GdlPool.getConstant(parts[i]));
View Full Code Here
283
284
285
286
287
288
289
290
291
292
293
    //"or" in them, especially if ors are nested. For best results, deOR
    //before testing.
    //The restriction goes something like this:
    //Look at all the terms in each positive relation in the rule that
    // is in a cycle with the head.
    GdlConstant head = rule.getHead().getName();
    Set<GdlRelation> cyclicRelations = new HashSet<GdlRelation>();
    Set<GdlRelation> acyclicRelations = new HashSet<GdlRelation>();
    for(GdlLiteral literal : rule.getBody()) {
      //Is it a relation?
      if(literal instanceof GdlRelation) {
View Full Code Here
403
404
405
406
407
408
409
410
411
412
413
  private static SetMultimap<GdlConstant, GdlConstant> getDependencyGraphAndValidateNoNegativeCycles(
      Set<GdlConstant> relationNames, List<GdlRule> rules) throws ValidatorException {
    SetMultimap<GdlConstant, GdlConstant> dependencyGraph = HashMultimap.create();
    SetMultimap<GdlConstant, GdlConstant> negativeEdges = HashMultimap.create();
    for(GdlRule rule : rules) {
      GdlConstant headName = rule.getHead().getName();
      for(GdlLiteral literal : rule.getBody()) {
        addLiteralAsDependent(literal, dependencyGraph.get(headName), negativeEdges.get(headName));
      }
    }
View Full Code Here
419
420
421
422
423
424
425
426
427
428
429
      SetMultimap<GdlConstant, GdlConstant> dependencyGraph,
      SetMultimap<GdlConstant, GdlConstant> negativeEdges,
      Set<GdlConstant> allNames) throws ValidatorException {
    while(!negativeEdges.isEmpty()) {
      //Look for a cycle containing this edge
      GdlConstant tail = negativeEdges.keySet().iterator().next();
      Set<GdlConstant> heads = negativeEdges.get(tail);
      negativeEdges.removeAll(tail);

      for(GdlConstant head : heads) {
        Set<GdlConstant> upstreamNames =
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
    return GdlPool.getDistinct(arg1, arg2);
  }

  private static GdlFunction createFunction(SymbolList list)
  {
    GdlConstant name = createConstant((SymbolAtom) list.get(0));

    List<GdlTerm> body = new ArrayList<GdlTerm>();
    for (int i = 1; i < list.size(); i++)
    {
      body.add(createTerm(list.get(i)));
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143
    return GdlPool.getProposition(createConstant(atom));
  }

  private static GdlRelation createRelation(SymbolList list)
  {
    GdlConstant name = createConstant((SymbolAtom) list.get(0));

    List<GdlTerm> body = new ArrayList<GdlTerm>();
    for (int i = 1; i < list.size(); i++)
    {
      body.add(createTerm(list.get(i)));
View Full Code Here
TOP

Related Classes of org.ggp.base.util.gdl.grammar.GdlConstant

  • org.ggp.base.player.request.factory.RequestFactory
  • org.ggp.base.util.gdl.factory.GdlFactory
  • org.ggp.base.util.gdl.model.AbstractSentenceForm
  • org.ggp.base.util.gdl.model.assignments.AssignmentFunction
  • org.ggp.base.util.gdl.model.assignments.AssignmentIteratorImpl
  • org.ggp.base.util.gdl.model.assignments.AssignmentsImpl
  • org.ggp.base.util.gdl.model.assignments.MutableFunctionInfo
  • org.ggp.base.util.gdl.model.FullSentenceFormDomain
  • org.ggp.base.util.gdl.model.SentenceDomainModelOptimizer
  • org.ggp.base.util.gdl.model.SentenceFormsFinder
    • 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.