Package aima.core.logic.fol.parsing.ast

Examples of aima.core.logic.fol.parsing.ast.Function

174
175
176
177
178
179
180
181
182
183
184
185
      // ((consp x) (or (occurs-in? var (first x) subst) (occurs-in? var
      // (rest x) subst)))
    } else if (x instanceof Function) {
      // (or (occurs-in? var (first x) subst) (occurs-in? var (rest x)
      // subst)))
      Function fx = (Function) x;
      for (Term fxt : fx.getArgs()) {
        if (occurCheck(theta, var, fxt)) {
          return true;
        }
      }
    }
View Full Code Here
403
404
405
406
407
408
409
410
411
412
413
      for (Variable eVar : sentence.getVariables()) {
        if (universalScope.size() > 0) {
          // Replace with a Skolem Function
          String skolemFunctionName = parser.getFOLDomain()
              .addSkolemFunction();
          skolemSubst.put(eVar, new Function(skolemFunctionName,
              new ArrayList<Term>(universalScope)));
        } else {
          // Replace with a Skolem Constant
          String skolemConstantName = parser.getFOLDomain()
              .addSkolemConstant();
View Full Code Here
229
230
231
232
233
234
235
  // PRIVATE METHODS
  //
  private Function getBrotherOfFunction(Term t) {
    List<Term> l = new ArrayList<Term>();
    l.add(t);
    return new Function("BrotherOf", l);
  }
View Full Code Here
235
236
237
238
239
240
241
  }

  private Function getEnemyOfFunction() {
    List<Term> l = new ArrayList<Term>();
    l.add(new Constant("Saladin"));
    return new Function("EnemyOf", l);
  }
View Full Code Here
243
244
245
246
247
248
249
  private Function getLegsOfFunction() {
    List<Term> l = new ArrayList<Term>();
    l.add(new Constant("John"));
    l.add(new Constant("Saladin"));
    l.add(new Constant("Richard"));
    return new Function("LegsOf", l);
  }
View Full Code Here
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
    // Should be: [{P(F(c#),F(c#)),P(G(F(c#)),F(c#))}]
    c = c.getNonTrivialFactors().iterator().next();
    Literal p = c.getPositiveLiterals().get(0);
    Assert.assertEquals("P", p.getAtomicSentence().getSymbolicName());
    Function f = (Function) p.getAtomicSentence().getArgs().get(0);
    Assert.assertEquals("F", f.getFunctionName());
    Variable v = (Variable) f.getTerms().get(0);
    f = (Function) p.getAtomicSentence().getArgs().get(1);
    Assert.assertEquals("F", f.getFunctionName());
    Assert.assertEquals(v, f.getTerms().get(0));

    //
    p = c.getPositiveLiterals().get(1);
    f = (Function) p.getAtomicSentence().getArgs().get(0);
    Assert.assertEquals("G", f.getFunctionName());
    f = (Function) f.getTerms().get(0);
    Assert.assertEquals("F", f.getFunctionName());
    Assert.assertEquals(v, f.getTerms().get(0));
    f = (Function) p.getAtomicSentence().getArgs().get(1);
    Assert.assertEquals("F", f.getFunctionName());
    Assert.assertEquals(v, f.getTerms().get(0));

    // p(g(x)), q(x), p(f(a)), p(x), p(g(f(x))), q(f(a))
    c = new Clause();
    c.addPositiveLiteral((Predicate) parser.parse("P(G(x))"));
    c.addPositiveLiteral((Predicate) parser.parse("Q(x)"));
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
150
      // ((consp x) (or (occurs-in? var (first x) subst) (occurs-in? var
      // (rest x) subst)))
    } else if (x instanceof Function) {
      // (or (occurs-in? var (first x) subst) (occurs-in? var (rest x)
      // subst)))
      Function fx = (Function) x;
      for (Term fxt : fx.getArgs()) {
        if (occurCheck(theta, var, fxt)) {
          return true;
        }
      }
    }
View Full Code Here
132
133
134
135
136
137
138
139
140
    Assert.assertEquals(2, result.size());

    List<Term> terms = new ArrayList<Term>();
    terms.add(new Constant("John"));
    Function mother = new Function("Mother", terms);
    Assert.assertEquals(mother, theta.get(new Variable("x")));
    Assert.assertEquals(new Constant("John"), theta.get(new Variable("y")));
  }
View Full Code Here
235
236
237
238
239
240
241
      List<Term> newTerms = new ArrayList<Term>();
      for (Term t : function.getTerms()) {
        Term subsTerm = (Term) t.accept(this, arg);
        newTerms.add(subsTerm);
      }
      return new Function(function.getFunctionName(), newTerms);
    }
View Full Code Here
306
307
308
309
310
311
312
313
314
315
316
317
318
319
    FOLKnowledgeBase akb = FOLKnowledgeBaseFactory
        .createABCDEqualityAndSubstitutionKnowledgeBase(infp, true);

    List<Term> terms = new ArrayList<Term>();
    terms.add(new Constant("A"));
    Function fa = new Function("F", terms);
    terms = new ArrayList<Term>();
    terms.add(fa);
    TermEquality query = new TermEquality(new Function("F", terms),
        new Constant("A"));

    InferenceResult answer = akb.ask(query);

    Assert.assertTrue(null != answer);
View Full Code Here
TOP

Related Classes of aima.core.logic.fol.parsing.ast.Function

  • aima.core.logic.fol.inference.AbstractModulation$ReplaceMatchingTerm
  • aima.core.logic.fol.parsing.AbstractFOLVisitor
  • aima.core.logic.fol.parsing.FOLParser
  • aima.core.logic.fol.RemoveQuantifiers
  • aima.core.logic.fol.Unifier
  • aima.test.core.unit.logic.fol.CommonFOLInferenceProcedureTests
  • aima.test.core.unit.logic.fol.kb.data.ClauseTest
  • aima.test.core.unit.logic.fol.parsing.FOLParserTest
  • aima.test.core.unit.logic.fol.UnifierTest
    • 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.