Package aima.core.logic.propositional.visitors

Examples of aima.core.logic.propositional.visitors.SymbolClassifier

132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
  //

  private Set<Sentence> filterOutClausesWithTwoComplementaryLiterals(
      Set<Sentence> clauses) {
    Set<Sentence> filtered = new HashSet<Sentence>();
    SymbolClassifier classifier = new SymbolClassifier();
    Iterator<Sentence> iter = clauses.iterator();
    while (iter.hasNext()) {
      Sentence clause = iter.next();
      Set<Symbol> positiveSymbols = classifier
          .getPositiveSymbolsIn(clause);
      Set<Symbol> negativeSymbols = classifier
          .getNegativeSymbolsIn(clause);
      if ((SetOps.intersection(positiveSymbols, negativeSymbols).size() == 0)) {
        filtered.add(clause);
      }
    }
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
    Set<Symbol> positiveInClause1NegativeInClause2,
        negativeInClause1PositiveInClause2;

    public ClauseSymbols(Sentence clause1, Sentence clause2) {

      SymbolClassifier classifier = new SymbolClassifier();

      clause1Symbols = classifier.getSymbolsIn(clause1);
      clause1PositiveSymbols = classifier.getPositiveSymbolsIn(clause1);
      clause1NegativeSymbols = classifier.getNegativeSymbolsIn(clause1);

      clause2Symbols = classifier.getSymbolsIn(clause2);
      clause2PositiveSymbols = classifier.getPositiveSymbolsIn(clause2);
      clause2NegativeSymbols = classifier.getNegativeSymbolsIn(clause2);

      positiveInClause1NegativeInClause2 = SetOps.intersection(
          clause1PositiveSymbols, clause2NegativeSymbols);
      negativeInClause1PositiveInClause2 = SetOps.intersection(
          clause1NegativeSymbols, clause2PositiveSymbols);
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
    // System.out.println("model= " + model);
    // }

    // debug
    List<Symbol> purePositiveSymbols = SYMBOL_CONVERTER.setToList(SetOps
        .difference(new SymbolClassifier()
            .getPurePositiveSymbolsIn(nonTrueClauses),
            symbolsAlreadyAssigned));

    List<Symbol> pureNegativeSymbols = SYMBOL_CONVERTER.setToList(SetOps
        .difference(new SymbolClassifier()
            .getPureNegativeSymbolsIn(nonTrueClauses),
            symbolsAlreadyAssigned));
    // if none found return "not found
    if ((purePositiveSymbols.size() == 0)
        && (pureNegativeSymbols.size() == 0)) {
View Full Code Here
218
219
220
221
222
223
224
225
226
227
228
229
230
    return true;
  }

  private boolean isClauseTrueInModel(Sentence clause, Model model) {
    List<Symbol> positiveSymbols = SYMBOL_CONVERTER
        .setToList(new SymbolClassifier().getPositiveSymbolsIn(clause));
    List<Symbol> negativeSymbols = SYMBOL_CONVERTER
        .setToList(new SymbolClassifier().getNegativeSymbolsIn(clause));

    for (Symbol symbol : positiveSymbols) {
      if ((model.isTrue(symbol))) {
        return true;
      }
View Full Code Here
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
  //

  private Set<Sentence> filterOutClausesWithTwoComplementaryLiterals(
      Set<Sentence> clauses) {
    Set<Sentence> filtered = new HashSet<Sentence>();
    SymbolClassifier classifier = new SymbolClassifier();
    Iterator<Sentence> iter = clauses.iterator();
    while (iter.hasNext()) {
      Sentence clause = iter.next();
      Set<Symbol> positiveSymbols = classifier
          .getPositiveSymbolsIn(clause);
      Set<Symbol> negativeSymbols = classifier
          .getNegativeSymbolsIn(clause);
      if ((SetOps.intersection(positiveSymbols, negativeSymbols).size() == 0)) {
        filtered.add(clause);
      }
    }
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
    Set<Symbol> positiveInClause1NegativeInClause2,
        negativeInClause1PositiveInClause2;

    public ClauseSymbols(Sentence clause1, Sentence clause2) {

      SymbolClassifier classifier = new SymbolClassifier();

      clause1Symbols = classifier.getSymbolsIn(clause1);
      clause1PositiveSymbols = classifier.getPositiveSymbolsIn(clause1);
      clause1NegativeSymbols = classifier.getNegativeSymbolsIn(clause1);

      clause2Symbols = classifier.getSymbolsIn(clause2);
      clause2PositiveSymbols = classifier.getPositiveSymbolsIn(clause2);
      clause2NegativeSymbols = classifier.getNegativeSymbolsIn(clause2);

      positiveInClause1NegativeInClause2 = SetOps.intersection(
          clause1PositiveSymbols, clause2NegativeSymbols);
      negativeInClause1PositiveInClause2 = SetOps.intersection(
          clause1NegativeSymbols, clause2PositiveSymbols);
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
    // System.out.println("model= " + model);
    // }

    // debug
    List<Symbol> purePositiveSymbols = SYMBOL_CONVERTER.setToList(SetOps
        .difference(new SymbolClassifier()
            .getPurePositiveSymbolsIn(nonTrueClauses),
            symbolsAlreadyAssigned));

    List<Symbol> pureNegativeSymbols = SYMBOL_CONVERTER.setToList(SetOps
        .difference(new SymbolClassifier()
            .getPureNegativeSymbolsIn(nonTrueClauses),
            symbolsAlreadyAssigned));
    // if none found return "not found
    if ((purePositiveSymbols.size() == 0)
        && (pureNegativeSymbols.size() == 0)) {
View Full Code Here
188
189
190
191
192
193
194
195
196
197
198
199
200
    return true;
  }

  private boolean isClauseTrueInModel(Sentence clause, Model model) {
    List<Symbol> positiveSymbols = SYMBOL_CONVERTER
        .setToList(new SymbolClassifier().getPositiveSymbolsIn(clause));
    List<Symbol> negativeSymbols = SYMBOL_CONVERTER
        .setToList(new SymbolClassifier().getNegativeSymbolsIn(clause));

    for (Symbol symbol : positiveSymbols) {
      if ((model.isTrue(symbol))) {
        return true;
      }
View Full Code Here
20
21
22
23
24
25
26
27
28
  private PEParser parser;

  @Before
  public void setUp() {
    classifier = new SymbolClassifier();
    parser = new PEParser();

  }
View Full Code Here
TOP

Related Classes of aima.core.logic.propositional.visitors.SymbolClassifier

  • aima.core.logic.propositional.algorithms.DPLL
  • aima.core.logic.propositional.algorithms.PLResolution
  • aima.core.logic.propositional.algorithms.PLResolution$ClauseSymbols
  • aima.test.core.unit.logic.propositional.visitors.SymbolClassifierTest
    • 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.