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

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

172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
    // Ensure reflexivity axiom is added to usable if using paramodulation.
    if (isUseParamodulation()) {
      // Reflexivity Axiom: x = x
      TermEquality reflexivityAxiom = new TermEquality(new Variable("x"),
          new Variable("x"));
      Clause reflexivityClause = new Clause();
      reflexivityClause.addLiteral(new Literal(reflexivityAxiom));
      reflexivityClause = KB.standardizeApart(reflexivityClause);
      reflexivityClause.setStandardizedApartCheckNotRequired();
      usable.add(reflexivityClause);
    }

    Sentence notAlpha = new NotSentence(alpha);
    // Want to use an answer literal to pull
    // query variables where necessary
    Literal answerLiteral = KB.createAnswerLiteral(notAlpha);
    Set<Variable> answerLiteralVariables = KB
        .collectAllVariables(answerLiteral.getAtomicSentence());
    Clause answerClause = new Clause();

    if (answerLiteralVariables.size() > 0) {
      Sentence notAlphaWithAnswer = new ConnectedSentence(Connectors.OR,
          notAlpha, answerLiteral.getAtomicSentence());
      for (Clause c : KB.convertToClauses(notAlphaWithAnswer)) {
        c = KB.standardizeApart(c);
        c.setProofStep(new ProofStepGoal(c));
        c.setStandardizedApartCheckNotRequired();
        sos.addAll(c.getFactors());
      }

      answerClause.addLiteral(answerLiteral);
    } else {
      for (Clause c : KB.convertToClauses(notAlpha)) {
        c = KB.standardizeApart(c);
        c.setProofStep(new ProofStepGoal(c));
        c.setStandardizedApartCheckNotRequired();
View Full Code Here
238
239
240
241
242
243
244
245
246
247
248
    getLightestClauseHeuristic().initialSOS(sos);

    // * repeat
    do {
      // * clause <- the lightest member of sos
      Clause clause = getLightestClauseHeuristic().getLightestClause();
      if (null != clause) {
        // * move clause from sos to usable
        sos.remove(clause);
        getLightestClauseHeuristic().removedClauseFromSOS(clause);
        usable.add(clause);
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
    CNF cnf = cnfConverter.convertToCNF(s1);

    Assert.assertEquals(1, cnf.getNumberOfClauses());

    Clause simplified = simplifier.simplify(cnf.getConjunctionOfClauses()
        .get(0));

    Assert.assertEquals("[P(y,y), P(y,ONE), P(ONE,y)]",
        simplified.toString());
  }
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
    StandardizeApartIndexicalFactory.flush();
  }

  @Test
  public void testImmutable() {
    Clause c = new Clause();

    Assert.assertFalse(c.isImmutable());

    c.addNegativeLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    c.addPositiveLiteral(new Predicate("Pred2", new ArrayList<Term>()));

    c.setImmutable();

    Assert.assertTrue(c.isImmutable());

    try {
      c.addNegativeLiteral(new Predicate("Pred3", new ArrayList<Term>()));

      Assert.fail("Should have thrown an IllegalStateException");
    } catch (IllegalStateException ise) {
      // Ok, Expected
    }

    try {
      c.addPositiveLiteral(new Predicate("Pred3", new ArrayList<Term>()));

      Assert.fail("Should have thrown an IllegalStateException");
    } catch (IllegalStateException ise) {
      // Ok, Expected
    }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
    }
  }

  @Test
  public void testIsEmpty() {
    Clause c1 = new Clause();
    Assert.assertTrue(c1.isEmpty());

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

    Clause c2 = new Clause();
    Assert.assertTrue(c2.isEmpty());

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

    Clause c3 = new Clause();
    Assert.assertTrue(c3.isEmpty());

    c3.addNegativeLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    c3.addPositiveLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    // Should be empty as they resolved with each other
    Assert.assertFalse(c3.isEmpty());

    c3.addNegativeLiteral(new Predicate("Pred1", new ArrayList<Term>()));
    c3.addPositiveLiteral(new Predicate("Pred2", new ArrayList<Term>()));
    Assert.assertFalse(c3.isEmpty());
  }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
    Assert.assertFalse(c3.isEmpty());
  }

  @Test
  public void testIsHornClause() {
    Clause c1 = new Clause();
    Assert.assertFalse(c1.isHornClause());

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

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

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

    c1.addPositiveLiteral(new Predicate("Pred5", new ArrayList<Term>()));
    Assert.assertFalse(c1.isHornClause());
  }
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
    Assert.assertFalse(c1.isHornClause());
  }

  @Test
  public void testIsDefiniteClause() {
    Clause c1 = new Clause();
    Assert.assertFalse(c1.isDefiniteClause());

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

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

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

    c1.addPositiveLiteral(new Predicate("Pred5", new ArrayList<Term>()));
    Assert.assertFalse(c1.isDefiniteClause());
  }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
    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);

    Set<Clause> paras = paramodulation.apply(c1, c2);
    Assert.assertEquals(2, paras.size());

    Iterator<Clause> it = paras.iterator();
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
    lits.add(new Literal(a2));
    lits.add(new Literal(a3));
    lits.add(new Literal(a4));
    lits.add(new Literal(a5));

    Clause c1 = new Clause(lits);

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

    Clause c2 = new Clause(lits);

    Set<Clause> paras = paramodulation.apply(c1, c2);
    Assert.assertEquals(5, paras.size());

    Iterator<Clause> it = paras.iterator();
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
    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("x = x");
    lits.add(new Literal(a1));

    Clause c2 = new Clause(lits);

    Set<Clause> paras = paramodulation.apply(c1, c2);
    Assert.assertEquals(0, paras.size());
  }
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.