Package aima.core.logic.fol.kb.data

Examples of aima.core.logic.fol.kb.data.Clause

170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
    List<Literal> lits = new ArrayList<Literal>();
    AtomicSentence a1 = (AtomicSentence) parser.parse("P(y, F(A,y))");
    lits.add(new Literal(a1));

    Clause c1 = new Clause(lits);

    lits.clear();
    a1 = (AtomicSentence) parser.parse("F(x,B) = x");
    lits.add(new Literal(a1, true));

    Clause c2 = new Clause(lits);

    Set<Clause> paras = paramodulation.apply(c1, c2);
    Assert.assertEquals(0, paras.size());
  }
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
    Assert.assertFalse(c1.isDefiniteClause());
  }

  @Test
  public void testIsUnitClause() {
    Clause c1 = new Clause();
    Assert.assertFalse(c1.isUnitClause());

    c1.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    Assert.assertTrue(c1.isUnitClause());

    c1.addPositiveLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    Assert.assertFalse(c1.isUnitClause());

    c1 = new Clause();
    Assert.assertFalse(c1.isUnitClause());

    c1.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    Assert.assertTrue(c1.isUnitClause());

    c1.addNegativeLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    Assert.assertFalse(c1.isUnitClause());

    c1 = new Clause();
    Assert.assertFalse(c1.isUnitClause());

    c1.addNegativeLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    Assert.assertTrue(c1.isUnitClause());

    c1.addPositiveLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    Assert.assertFalse(c1.isUnitClause());
  }
View Full Code Here
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
    Assert.assertFalse(c1.isUnitClause());
  }

  @Test
  public void testIsImplicationDefiniteClause() {
    Clause c1 = new Clause();
    Assert.assertFalse(c1.isImplicationDefiniteClause());

    c1.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    Assert.assertFalse(c1.isImplicationDefiniteClause());

    c1.addNegativeLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    Assert.assertTrue(c1.isImplicationDefiniteClause());
    c1.addNegativeLiteral(new Predicate("Pred3", new ArrayList<Term>()));
    Assert.assertTrue(c1.isImplicationDefiniteClause());

    c1.addPositiveLiteral(new Predicate("Pred4", new ArrayList<Term>()));
    Assert.assertFalse(c1.isImplicationDefiniteClause());
  }
View Full Code Here
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
    AtomicSentence a1 = (AtomicSentence) parser.parse("P(F(x,B),x)");
    AtomicSentence a2 = (AtomicSentence) parser.parse("Q(x)");
    lits.add(new Literal(a1));
    lits.add(new Literal(a2));

    Clause c1 = new Clause(lits);

    lits.clear();
    a1 = (AtomicSentence) parser.parse("F(A,y) = y");
    a2 = (AtomicSentence) parser.parse("R(y)");
    lits.add(new Literal(a1));
    lits.add(new Literal(a2));

    Clause c2 = new Clause(lits);

    Paramodulation paramodulation = new Paramodulation();
    Set<Clause> paras = paramodulation.apply(c1, c2);

    System.out.println("Paramodulate '" + c1 + "' with '" + c2
View Full Code Here
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
    domain.addPredicate("Pred1");
    domain.addPredicate("Pred2");
    domain.addPredicate("Pred3");
    domain.addPredicate("Pred4");

    Clause c1 = new Clause();

    // Ensure that resolving to self when empty returns an empty clause
    Assert.assertNotNull(c1.binaryResolvents(c1));
    Assert.assertEquals(1, c1.binaryResolvents(c1).size());
    Assert.assertTrue(c1.binaryResolvents(c1).iterator().next().isEmpty());

    // Check if resolve with self to an empty clause
    c1.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    c1.addNegativeLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    Assert.assertNotNull(c1.binaryResolvents(c1));
    Assert.assertEquals(1, c1.binaryResolvents(c1).size());
    // i.e. resolving a tautology with a tautology gives you
    // back a tautology.
    Assert.assertEquals("[~Pred1(), Pred1()]", c1.binaryResolvents(c1)
        .iterator().next().toString());

    // Check if try to resolve with self and no resolvents
    c1 = new Clause();
    c1.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    Assert.assertEquals(0, c1.binaryResolvents(c1).size());

    c1 = new Clause();
    Clause c2 = new Clause();
    // Ensure that two empty clauses resolve to an empty clause
    Assert.assertNotNull(c1.binaryResolvents(c2));
    Assert.assertEquals(1, c1.binaryResolvents(c2).size());
    Assert.assertTrue(c1.binaryResolvents(c2).iterator().next().isEmpty());
    Assert.assertNotNull(c2.binaryResolvents(c1));
    Assert.assertEquals(1, c2.binaryResolvents(c1).size());
    Assert.assertTrue(c2.binaryResolvents(c1).iterator().next().isEmpty());

    // Enusre the two complementary clauses resolve
    // to the empty clause
    c1.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    c2.addNegativeLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    Assert.assertNotNull(c1.binaryResolvents(c2));
    Assert.assertEquals(1, c1.binaryResolvents(c2).size());
    Assert.assertTrue(c1.binaryResolvents(c2).iterator().next().isEmpty());
    Assert.assertNotNull(c2.binaryResolvents(c1));
    Assert.assertEquals(1, c2.binaryResolvents(c1).size());
    Assert.assertTrue(c2.binaryResolvents(c1).iterator().next().isEmpty());

    // Ensure that two clauses that have two complementaries
    // resolve with two resolvents
    c1.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    c2.addNegativeLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    c1.addPositiveLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    c2.addNegativeLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    Assert.assertNotNull(c1.binaryResolvents(c2));
    Assert.assertEquals(2, c1.binaryResolvents(c2).size());
    Assert.assertNotNull(c2.binaryResolvents(c1));
    Assert.assertEquals(2, c2.binaryResolvents(c1).size());

    // Ensure two clauses that factor are not
    // considered resolved
    c1 = new Clause();
    c2 = new Clause();
    c1.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    c1.addPositiveLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    c1.addNegativeLiteral(new Predicate("Pred3", new ArrayList<Term>()));
    c1.addNegativeLiteral(new Predicate("Pred4", new ArrayList<Term>()));
    c2.addPositiveLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    c2.addNegativeLiteral(new Predicate("Pred4", new ArrayList<Term>()));
    Assert.assertNotNull(c1.binaryResolvents(c2));
    Assert.assertEquals(0, c1.binaryResolvents(c2).size());
    Assert.assertNotNull(c2.binaryResolvents(c1));
    Assert.assertEquals(0, c2.binaryResolvents(c1).size());

    // Ensure the resolvent is a subset of the originals
    c1 = new Clause();
    c2 = new Clause();
    c1.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    c1.addNegativeLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    c1.addNegativeLiteral(new Predicate("Pred3", new ArrayList<Term>()));
    c2.addPositiveLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    Assert.assertNotNull(c1.binaryResolvents(c2));
    Assert.assertNotNull(c2.binaryResolvents(c1));
    Assert.assertEquals(1, c1.binaryResolvents(c2).iterator().next()
        .getNumberPositiveLiterals());
    Assert.assertEquals(1, c1.binaryResolvents(c2).iterator().next()
        .getNumberNegativeLiterals());
    Assert.assertEquals(1, c2.binaryResolvents(c1).iterator().next()
        .getNumberPositiveLiterals());
    Assert.assertEquals(1, c2.binaryResolvents(c1).iterator().next()
        .getNumberNegativeLiterals());
  }
View Full Code Here
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
      clauses.addAll(newClauses);
      newClauses.clear();
      Clause[] clausesA = new Clause[clauses.size()];
      clauses.toArray(clausesA);
      for (int i = 0; i < clausesA.length; i++) {
        Clause cI = clausesA[i];
        for (int j = 0; j < clausesA.length; j++) {
          Clause cJ = clausesA[j];

          newClauses.addAll(cI.getFactors());
          newClauses.addAll(cJ.getFactors());

          Set<Clause> cIresolvents = cI.binaryResolvents(cJ);
          Set<Clause> cJresolvents = cJ.binaryResolvents(cI);
          if (!cIresolvents.equals(cJresolvents)) {
            System.err.println("cI=" + cI);
            System.err.println("cJ=" + cJ);
            System.err.println("cIR=" + cIresolvents);
            System.err.println("cJR=" + cJresolvents);
View Full Code Here
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
    domain.addConstant("B");

    FOLParser parser = new FOLParser(domain);

    // B = A
    Clause c1 = new Clause();
    c1.addPositiveLiteral((AtomicSentence) parser.parse("B = A"));

    Clause c2 = new Clause();
    c2.addNegativeLiteral((AtomicSentence) parser.parse("B = A"));
    c2.addPositiveLiteral((AtomicSentence) parser.parse("B = A"));

    Set<Clause> resolvents = c1.binaryResolvents(c2);

    Assert.assertEquals(1, resolvents.size());
    Assert.assertEquals("[[B = A]]", resolvents.toString());
View Full Code Here
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
    pts1.add(var1);
    pts2.add(cons2);
    pts2.add(cons1);
    pts2.add(var1);

    Clause c1 = new Clause();
    Clause c2 = new Clause();
    Assert.assertEquals(c1.hashCode(), c2.hashCode());

    c1.addNegativeLiteral(new Predicate("Pred1", pts1));
    Assert.assertNotSame(c1.hashCode(), c2.hashCode());
    c2.addNegativeLiteral(new Predicate("Pred1", pts1));
    Assert.assertEquals(c1.hashCode(), c2.hashCode());

    c1.addPositiveLiteral(new Predicate("Pred1", pts1));
    Assert.assertNotSame(c1.hashCode(), c2.hashCode());
    c2.addPositiveLiteral(new Predicate("Pred1", pts1));
    Assert.assertEquals(c1.hashCode(), c2.hashCode());
  }
View Full Code Here
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
    pts1.add(var1);
    pts2.add(cons2);
    pts2.add(cons1);
    pts2.add(var1);

    Clause c1 = new Clause();
    Clause c2 = new Clause();
    Assert.assertTrue(c1.equals(c1));
    Assert.assertTrue(c2.equals(c2));
    Assert.assertTrue(c1.equals(c2));
    Assert.assertTrue(c2.equals(c1));

    // Check negatives
    c1.addNegativeLiteral(new Predicate("Pred1", pts1));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c2.addNegativeLiteral(new Predicate("Pred1", pts1));
    Assert.assertTrue(c1.equals(c2));
    Assert.assertTrue(c2.equals(c1));

    c1.addNegativeLiteral(new Predicate("Pred2", pts2));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c2.addNegativeLiteral(new Predicate("Pred2", pts2));
    Assert.assertTrue(c1.equals(c2));
    Assert.assertTrue(c2.equals(c1));
    // Check same but added in different order
    c1.addNegativeLiteral(new Predicate("Pred3", pts1));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c1.addNegativeLiteral(new Predicate("Pred4", pts1));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c2.addNegativeLiteral(new Predicate("Pred4", pts1));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c2.addNegativeLiteral(new Predicate("Pred3", pts1));
    Assert.assertTrue(c1.equals(c2));
    Assert.assertTrue(c2.equals(c1));

    // Check positives
    c1.addPositiveLiteral(new Predicate("Pred1", pts1));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c2.addPositiveLiteral(new Predicate("Pred1", pts1));
    Assert.assertTrue(c1.equals(c2));
    Assert.assertTrue(c2.equals(c1));

    c1.addPositiveLiteral(new Predicate("Pred2", pts2));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c2.addPositiveLiteral(new Predicate("Pred2", pts2));
    Assert.assertTrue(c1.equals(c2));
    Assert.assertTrue(c2.equals(c1));
    // Check same but added in different order
    c1.addPositiveLiteral(new Predicate("Pred3", pts1));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c1.addPositiveLiteral(new Predicate("Pred4", pts1));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c2.addPositiveLiteral(new Predicate("Pred4", pts1));
    Assert.assertFalse(c1.equals(c2));
    Assert.assertFalse(c2.equals(c1));
    c2.addPositiveLiteral(new Predicate("Pred3", pts1));
    Assert.assertTrue(c1.equals(c2));
    Assert.assertTrue(c2.equals(c1));
  }
View Full Code Here
491
492
493
494
495
496
497
498
499
500
501
502
    Sentence s1 = parser.parse("((x1 = y1 AND y1 = z1) => x1 = z1)");
    Sentence s2 = parser.parse("((x2 = y2 AND F(y2) = z2) => F(x2) = z2)");
    CNF cnf1 = cnfConverter.convertToCNF(s1);
    CNF cnf2 = cnfConverter.convertToCNF(s2);

    Clause c1 = cnf1.getConjunctionOfClauses().get(0);
    Clause c2 = cnf2.getConjunctionOfClauses().get(0);

    Assert.assertFalse(c1.equals(c2));

    s1 = parser.parse("((x1 = y1 AND y1 = z1) => x1 = z1)");
    s2 = parser.parse("((x2 = y2 AND y2 = z2) => x2 = z2)");
View Full Code Here
TOP

Related Classes of aima.core.logic.fol.kb.data.Clause

  • aima.core.logic.fol.CNFConstructor
  • aima.core.logic.fol.CNFConstructor$ArgData
  • aima.core.logic.fol.inference.Demodulation
  • aima.core.logic.fol.inference.FOLOTTERLikeTheoremProver
  • aima.core.logic.fol.inference.FOLTFMResolution
  • aima.core.logic.fol.inference.otter.defaultimpl.DefaultClauseSimplifier
  • aima.core.logic.fol.inference.otter.defaultimpl.DefaultLightestClauseHeuristic
  • aima.core.logic.fol.inference.Paramodulation
  • aima.core.logic.fol.inference.proof.ProofStepClauseBinaryResolvent
  • aima.core.logic.fol.inference.proof.ProofStepClauseFactor
    • 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.