Package aima.core.logic.fol.domain

Examples of aima.core.logic.fol.domain.FOLDomain

689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
  // Note: Tests derived from:
  // http://logic.stanford.edu/classes/cs157/2008/lectures/lecture12.pdf
  // slides 17 and 18.
  @Test
  public void testSubsumes() {
    FOLDomain domain = new FOLDomain();
    domain.addConstant("A");
    domain.addConstant("B");
    domain.addConstant("C");
    domain.addConstant("D");
    domain.addConstant("E");
    domain.addConstant("F");
    domain.addConstant("G");
    domain.addConstant("H");
    domain.addConstant("I");
    domain.addConstant("J");
    domain.addPredicate("P");
    domain.addPredicate("Q");

    FOLParser parser = new FOLParser(domain);

    // Example
    // {~p(a,b),q(c)}
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
  private static void fOL_CNFConversion() {
    System.out.println("-------------------------------------------------");
    System.out.println("Conjuctive Normal Form for First Order Logic Demo");
    System.out.println("-------------------------------------------------");
    FOLDomain domain = DomainFactory.lovesAnimalDomain();
    FOLParser parser = new FOLParser(domain);

    Sentence origSentence = parser
        .parse("FORALL x (FORALL y (Animal(y) => Loves(x, y)) => EXISTS y Loves(y, x))");
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
  private static void fOL_Demodulation() {
    System.out.println("-----------------");
    System.out.println("Demodulation Demo");
    System.out.println("-----------------");
    FOLDomain domain = new FOLDomain();
    domain.addConstant("A");
    domain.addConstant("B");
    domain.addConstant("C");
    domain.addConstant("D");
    domain.addConstant("E");
    domain.addPredicate("P");
    domain.addFunction("F");
    domain.addFunction("G");
    domain.addFunction("H");
    domain.addFunction("J");

    FOLParser parser = new FOLParser(domain);

    Predicate expression = (Predicate) parser
        .parse("P(A,F(B,G(A,H(B)),C),D)");
View Full Code Here
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
  // Note: Based on:
  // http://logic.stanford.edu/classes/cs157/2008/lectures/lecture15.pdf
  // Slide 31.
  @Test
  public void testSimpleExample() {
    FOLDomain domain = new FOLDomain();
    domain.addConstant("A");
    domain.addConstant("B");
    domain.addPredicate("P");
    domain.addPredicate("Q");
    domain.addPredicate("R");
    domain.addFunction("F");

    FOLParser parser = new FOLParser(domain);

    List<Literal> lits = new ArrayList<Literal>();
    AtomicSentence a1 = (AtomicSentence) parser.parse("P(F(x,B),x)");
View Full Code Here
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
  private static void fOL_Paramodulation() {
    System.out.println("-------------------");
    System.out.println("Paramodulation Demo");
    System.out.println("-------------------");

    FOLDomain domain = new FOLDomain();
    domain.addConstant("A");
    domain.addConstant("B");
    domain.addPredicate("P");
    domain.addPredicate("Q");
    domain.addPredicate("R");
    domain.addFunction("F");

    FOLParser parser = new FOLParser(domain);

    List<Literal> lits = new ArrayList<Literal>();
    AtomicSentence a1 = (AtomicSentence) parser.parse("P(F(x,B),x)");
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
        .toString());
  }

  @Test
  public void testMultipleTermEqualitiesInBothClausesExample() {
    FOLDomain domain = new FOLDomain();
    domain.addConstant("A");
    domain.addConstant("B");
    domain.addConstant("C");
    domain.addConstant("D");
    domain.addPredicate("P");
    domain.addPredicate("Q");
    domain.addPredicate("R");
    domain.addFunction("F");

    FOLParser parser = new FOLParser(domain);

    List<Literal> lits = new ArrayList<Literal>();
    AtomicSentence a1 = (AtomicSentence) parser.parse("F(C,x) = D");
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
        it.next().toString());
  }

  @Test
  public void testBypassReflexivityAxiom() {
    FOLDomain domain = new FOLDomain();
    domain.addConstant("A");
    domain.addConstant("B");
    domain.addConstant("C");
    domain.addPredicate("P");
    domain.addFunction("F");

    FOLParser parser = new FOLParser(domain);

    List<Literal> lits = new ArrayList<Literal>();
    AtomicSentence a1 = (AtomicSentence) parser.parse("P(y, F(A,y))");
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
    Assert.assertEquals(0, paras.size());
  }

  @Test
  public void testNegativeTermEquality() {
    FOLDomain domain = new FOLDomain();
    domain.addConstant("A");
    domain.addConstant("B");
    domain.addConstant("C");
    domain.addPredicate("P");
    domain.addFunction("F");

    FOLParser parser = new FOLParser(domain);

    List<Literal> lits = new ArrayList<Literal>();
    AtomicSentence a1 = (AtomicSentence) parser.parse("P(y, F(A,y))");
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
  // Note: Based on:
  // http://logic.stanford.edu/classes/cs157/2008/lectures/lecture15.pdf
  // Slide 22.
  @Test
  public void testSimpleAtomicExamples() {
    FOLDomain domain = new FOLDomain();
    domain.addConstant("A");
    domain.addConstant("B");
    domain.addConstant("C");
    domain.addConstant("D");
    domain.addConstant("E");
    domain.addPredicate("P");
    domain.addFunction("F");
    domain.addFunction("G");
    domain.addFunction("H");
    domain.addFunction("J");

    FOLParser parser = new FOLParser(domain);

    Predicate expression = (Predicate) parser
        .parse("P(A,F(B,G(A,H(B)),C),D)");
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
  // Note: Based on:
  // http://logic.stanford.edu/classes/cs157/2008/lectures/lecture15.pdf
  // Slide 23.
  @Test
  public void testSimpleAtomicNonExample() {
    FOLDomain domain = new FOLDomain();
    domain.addConstant("A");
    domain.addConstant("B");
    domain.addConstant("C");
    domain.addConstant("D");
    domain.addConstant("E");
    domain.addPredicate("P");
    domain.addFunction("F");
    domain.addFunction("G");
    domain.addFunction("H");
    domain.addFunction("J");

    FOLParser parser = new FOLParser(domain);

    Predicate expression = (Predicate) parser.parse("P(A,G(x,B),C)");
    TermEquality assertion = (TermEquality) parser.parse("G(A,y) = J(y)");
View Full Code Here
TOP

Related Classes of aima.core.logic.fol.domain.FOLDomain

  • aima.core.logic.fol.kb.FOLKnowledgeBase
  • aima.core.logic.fol.kb.FOLKnowledgeBaseFactory
  • aima.gui.demo.logic.FolDemo
  • aima.test.core.unit.logic.fol.CNFConverterTest
  • aima.test.core.unit.logic.fol.inference.DemodulationTest
  • aima.test.core.unit.logic.fol.inference.FOLOTTERLikeTheoremProverTest
  • aima.test.core.unit.logic.fol.inference.ParamodulationTest
  • aima.test.core.unit.logic.fol.kb.data.ClauseTest
  • aima.test.core.unit.logic.fol.parsing.FOLLexerTest
  • aima.test.core.unit.logic.fol.parsing.FOLParserTest
    • 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.