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
586
587
588
589
590
591
592
593
594
595
596
    Sentence first = sentence.getFirst();
    Sentence second = sentence.getSecond();

    first.accept(this, arg);
    if (Connectors.isAND(sentence.getConnector())) {
      ad.clauses.add(new Clause());
    }
    second.accept(this, arg);

    return sentence;
  }
View Full Code Here
606
607
608
609
610
611
612
  class ArgData {
    public List<Clause> clauses = new ArrayList<Clause>();
    public boolean negated = false;

    public ArgData() {
      clauses.add(new Clause());
    }
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
96
      List<Literal> literals = new ArrayList<Literal>();

      for (Literal l : clause.getLiterals()) {
        literals.add(substVisitor.subst(renameSubstitution, l));
      }
      Clause renamed = new Clause(literals);
      renamed.setProofStep(new ProofStepRenaming(renamed, clause
          .getProofStep()));
      return renamed;
    }

    return clause;
View Full Code Here
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
    FOLParser parser = new FOLParser(domain);

    // Example
    // {~p(a,b),q(c)}
    Clause psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C)"));
    // {~p(x,y)}
    Clause phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(x,y)"));

    Assert.assertTrue(phi.subsumes(psi));
    // Non-Example
    // {~p(x,b),q(x)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(x,B)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(x)"));
    // {~p(a,y)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(A,y)"));
    // Reason for Non-Example:
    // {p(b,b)}
    // {~q(b)}
    Assert.assertFalse(phi.subsumes(psi));

    //
    // Additional Examples

    // Non-Example
    // {~p(x,b),q(z)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(x,B)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(z)"));
    // {~p(a,y)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(A,y)"));

    Assert.assertFalse(phi.subsumes(psi));

    // Example
    // {~p(a,b),~p(w,z),q(c)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(w,z)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C)"));
    // {~p(x,y),~p(a,b)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(x,y)"));
    phi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));

    Assert.assertTrue(phi.subsumes(psi));

    // Non-Example
    // {~p(v,b),~p(w,z),q(c)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(v,B)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(w,z)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C)"));
    // {~p(x,y),~p(a,b)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(x,y)"));
    phi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));

    Assert.assertFalse(phi.subsumes(psi));

    // Example
    // {~p(a,b),~p(c,d),~p(e,f),~p(g,h),~p(i,j),q(c)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(C,D)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(E,F)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(G,H)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C)"));
    // {~p(i,j)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));

    Assert.assertTrue(phi.subsumes(psi));

    // Example
    // {~p(a,b),~p(c,d),~p(e,f),q(c)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(C,D)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(E,F)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C)"));
    // {~p(e,f),~p(a,b),~p(c,d)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(E,F)"));
    phi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    phi.addNegativeLiteral((Predicate) parser.parse("P(C,D)"));

    Assert.assertTrue(phi.subsumes(psi));

    // Example
    // {~p(a,b),~p(c,d),~p(e,f),~p(g,h),~p(i,j),q(c)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(C,D)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(E,F)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(G,H)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C)"));
    // {~p(i,j),~p(c,d)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    phi.addNegativeLiteral((Predicate) parser.parse("P(C,D)"));

    Assert.assertTrue(phi.subsumes(psi));

    // Non-Example
    // {~p(a,b),~p(x,d),~p(e,f),~p(g,h),~p(i,j),q(c)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(x,D)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(E,F)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(G,H)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C)"));
    // {~p(i,j),~p(c,d)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    phi.addNegativeLiteral((Predicate) parser.parse("P(C,D)"));

    Assert.assertFalse(phi.subsumes(psi));

    // Example
    // {~p(a,b),~p(c,d),~p(e,f),~p(g,h),~p(i,j),q(c)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(C,D)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(E,F)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(G,H)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C)"));
    // {~p(i,j),~p(a,x)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    phi.addNegativeLiteral((Predicate) parser.parse("P(A,x)"));

    Assert.assertTrue(phi.subsumes(psi));

    // Example
    // {~p(a,b),~p(c,d),~p(e,f),~p(g,h),~p(i,j),q(a,b),q(c,d),q(e,f)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(C,D)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(E,F)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(G,H)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(A,B)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C,D)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(E,F)"));
    // {~p(i,j),~p(a,b),q(e,f),q(a,b)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    phi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    phi.addPositiveLiteral((Predicate) parser.parse("Q(E,F)"));
    phi.addPositiveLiteral((Predicate) parser.parse("Q(A,B)"));

    Assert.assertTrue(phi.subsumes(psi));

    // Non-Example
    // {~p(a,b),~p(c,d),~p(e,f),~p(g,h),~p(i,j),q(a,b),q(c,d),q(e,f)}
    psi = new Clause();
    psi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(C,D)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(E,F)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(G,H)"));
    psi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(A,B)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(C,D)"));
    psi.addPositiveLiteral((Predicate) parser.parse("Q(E,F)"));
    // {~p(i,j),~p(a,b),q(e,f),q(a,b)}
    phi = new Clause();
    phi.addNegativeLiteral((Predicate) parser.parse("P(I,J)"));
    phi.addNegativeLiteral((Predicate) parser.parse("P(A,B)"));
    phi.addPositiveLiteral((Predicate) parser.parse("Q(E,A)"));
    phi.addPositiveLiteral((Predicate) parser.parse("Q(A,B)"));

    Assert.assertFalse(phi.subsumes(psi));
  }
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
  }

  //
  // START-LightestClauseHeuristic
  public Clause getLightestClause() {
    Clause lightest = null;

    if (sos.size() > 0) {
      lightest = sos.first();
    }
View Full Code Here
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
  }

  //
  // START-ClauseSimplifier
  public Clause simplify(Clause c) {
    Clause simplified = c;

    // Apply each of the rewrite rules to
    // the clause
    for (TermEquality te : rewrites) {
      Clause dc = simplified;
      // Keep applying the rewrite as many times as it
      // can be applied before moving on to the next one.
      while (null != (dc = demodulation.apply(te, dc))) {
        simplified = dc;
      }
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
    public void stepResolved(Clause iFactor, Clause jFactor,
        Set<Clause> resolvents) {
      noPairsResolved++;

      Clause egLargestClause = null;
      for (Clause c : resolvents) {
        if (c.getNumberLiterals() > maxClauseSizeSeen) {
          egLargestClause = c;
          maxClauseSizeSeen = c.getNumberLiterals();
        }
View Full Code Here
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
68
69
70
71
72
73
74
75
public class Demodulation extends AbstractModulation {
  public Demodulation() {
  }

  public Clause apply(TermEquality assertion, Clause clExpression) {
    Clause altClExpression = null;

    for (Literal l1 : clExpression.getLiterals()) {
      AtomicSentence altExpression = apply(assertion,
          l1.getAtomicSentence());
      if (null != altExpression) {
        // I have an alternative, create a new clause
        // with the alternative and return
        List<Literal> newLits = new ArrayList<Literal>();
        for (Literal l2 : clExpression.getLiterals()) {
          if (l1.equals(l2)) {
            newLits.add(l1.newInstance(altExpression));
          } else {
            newLits.add(l2);
          }
        }
        // Only apply demodulation at most once on
        // each call.
        altClExpression = new Clause(newLits);
        altClExpression.setProofStep(new ProofStepClauseDemodulation(
            altClExpression, clExpression, assertion));
        if (clExpression.isImmutable()) {
          altClExpression.setImmutable();
        }
        if (!clExpression.isStandardizedApartCheckRequired()) {
          altClExpression.setStandardizedApartCheckNotRequired();
        }
        break;
      }
    }
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.