Package aima.core.logic.propositional.parsing.ast

Examples of aima.core.logic.propositional.parsing.ast.Symbol

89
90
91
92
93
94
95
96
97
98
99
        List<Sentence> pair = pairs.get(i);
        // System.out.println("pair number" + i+" of "+pairs.size());
        Set<Sentence> resolvents = plResolve(pair.get(0), pair.get(1));
        resolvents = filterOutClausesWithTwoComplementaryLiterals(resolvents);

        if (resolvents.contains(new Symbol("EMPTY_CLAUSE"))) {
          return true;
        }
        newClauses = SetOps.union(newClauses, resolvents);
        // System.out.println("clauseslist size = " +clauses.size());
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
  public Set<Sentence> plResolve(Sentence clause1, Sentence clause2) {
    Set<Sentence> resolvents = new HashSet<Sentence>();
    ClauseSymbols cs = new ClauseSymbols(clause1, clause2);
    Iterator<Symbol> iter = cs.getComplementedSymbols().iterator();
    while (iter.hasNext()) {
      Symbol symbol = iter.next();
      resolvents.add(createResolventClause(cs, symbol));
    }

    return resolvents;
  }
View Full Code Here
170
171
172
173
174
175
176
177
178
179
180
    }
    for (int i = 0; i < negativeSymbols.size(); i++) {
      sentences.add(new UnarySentence(negativeSymbols.get(i)));
    }
    if (sentences.size() == 0) {
      return new Symbol("EMPTY_CLAUSE"); // == empty clause
    } else {
      return LogicUtils.chainWith("OR", sentences);
    }

  }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
    if ((purePositiveSymbols.size() == 0)
        && (pureNegativeSymbols.size() == 0)) {
      return new SymbolValuePair();// automatically set to null values
    } else {
      if (purePositiveSymbols.size() > 0) {
        Symbol symbol = new Symbol(
            (purePositiveSymbols.get(0)).getValue());
        if (pureNegativeSymbols.contains(symbol)) {
          throw new RuntimeException("Symbol " + symbol.getValue()
              + "misclassified");
        }
        return new SymbolValuePair(symbol, true);
      } else {
        Symbol symbol = new Symbol(
            (pureNegativeSymbols.get(0)).getValue());
        if (purePositiveSymbols.contains(symbol)) {
          throw new RuntimeException("Symbol " + symbol.getValue()
              + "misclassified");
        }
        return new SymbolValuePair(symbol, false);
      }
    }
View Full Code Here
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
    // try to find a unit clause
    SymbolValuePair svp = findPureSymbolValuePair(clauseList, model,
        symbols);
    if (svp.notNull()) {
      List<Symbol> newSymbols = new ArrayList<Symbol>(symbols);
      newSymbols.remove(new Symbol(svp.symbol.getValue()));
      Model newModel = model.extend(new Symbol(svp.symbol.getValue()),
          svp.value.booleanValue());
      return dpll(clauses, newSymbols, newModel);
    }

    SymbolValuePair svp2 = findUnitClause(clauseList, model, symbols);
    if (svp2.notNull()) {
      List<Symbol> newSymbols = new ArrayList<Symbol>(symbols);
      newSymbols.remove(new Symbol(svp2.symbol.getValue()));
      Model newModel = model.extend(new Symbol(svp2.symbol.getValue()),
          svp2.value.booleanValue());
      return dpll(clauses, newSymbols, newModel);
    }

    Symbol symbol = (Symbol) symbols.get(0);
    // System.out.println("default behaviour selecting " + symbol);
    List<Symbol> newSymbols = new ArrayList<Symbol>(symbols);
    newSymbols.remove(0);
    return (dpll(clauses, newSymbols, model.extend(symbol, true)) || dpll(
        clauses, newSymbols, model.extend(symbol, false)));
View Full Code Here
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
    for (int i = 0; i < clauseList.size(); i++) {
      Sentence clause = (Sentence) clauseList.get(i);
      if ((clause instanceof Symbol)
          && (!(model.getAssignedSymbols().contains(clause)))) {
        // System.out.println("found unit clause - assigning");
        return new SymbolValuePair(new Symbol(
            ((Symbol) clause).getValue()), true);
      }

      if (clause instanceof UnarySentence) {
        UnarySentence sentence = (UnarySentence) clause;
        Sentence negated = sentence.getNegated();
        if ((negated instanceof Symbol)
            && (!(model.getAssignedSymbols().contains(negated)))) {
          // System.out.println("found unit clause type 2 -
          // assigning");
          return new SymbolValuePair(new Symbol(
              ((Symbol) negated).getValue()), false);
        }
      }

    }
View Full Code Here
30
31
32
33
34
35
36
    inferred = new Hashtable<Symbol, Boolean>();
    agenda = new Stack<Symbol>();
  }

  public boolean plfcEntails(KnowledgeBase kb, String s) {
    return plfcEntails(kb, new Symbol(s));
  }
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
  }

  public boolean plfcEntails(KnowledgeBase kb, Symbol q) {
    List<HornClause> hornClauses = asHornClauses(kb.getSentences());
    while (agenda.size() != 0) {
      Symbol p = agenda.pop();
      while (!inferred(p)) {
        inferred.put(p, Boolean.TRUE);

        for (int i = 0; i < hornClauses.size(); i++) {
          HornClause hornClause = hornClauses.get(i);
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
      } else {
        // System.out.println("0");
        return true;
      }
    } else {
      Symbol symbol = Util.first(symbols);
      List<Symbol> rest = Util.rest(symbols);

      Model trueModel = model.extend(new Symbol(symbol.getValue()), true);
      Model falseModel = model.extend(new Symbol(symbol.getValue()),
          false);
      return (ttCheckAll(kbSentence, querySentence, rest, trueModel) && (ttCheckAll(
          kbSentence, querySentence, rest, falseModel)));
    }
  }
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
52
53
54
55
56
57
58
59
60
61
62
63
    CNFClauseGatherer clauseGatherer = new CNFClauseGatherer();
    SymbolCollector sc = new SymbolCollector();

    List<Symbol> symbols = new Converter<Symbol>().setToList(sc.getSymbolsIn(s));
    for (int i = 0; i < symbols.size(); i++) {
      Symbol sym = (Symbol) symbols.get(i);
      myModel = myModel.extend(sym, Util.randomBoolean());
    }
    List<Sentence> clauses = new Converter<Sentence>()
        .setToList(clauseGatherer.getClausesFrom(transformer
            .transform(s)));

    for (int i = 0; i < numberOfFlips; i++) {
      if (getNumberOfClausesSatisfiedIn(
          new Converter<Sentence>().listToSet(clauses), myModel) == clauses
          .size()) {
        return myModel;
      }
      Sentence clause = clauses.get(random.nextInt(clauses.size()));

      List<Symbol> symbolsInClause = new Converter<Symbol>().setToList(sc
          .getSymbolsIn(clause));
      if (random.nextDouble() >= probabilityOfRandomWalk) {
        Symbol randomSymbol = symbolsInClause.get(random
            .nextInt(symbolsInClause.size()));
        myModel = myModel.flip(randomSymbol);
      } else {
        Symbol symbolToFlip = getSymbolWhoseFlipMaximisesSatisfiedClauses(
            new Converter<Sentence>().listToSet(clauses),
            symbolsInClause, myModel);
        myModel = myModel.flip(symbolToFlip);
      }
View Full Code Here
TOP

Related Classes of aima.core.logic.propositional.parsing.ast.Symbol

  • aima.core.logic.propositional.algorithms.DPLL
  • aima.core.logic.propositional.algorithms.PLFCEntails
  • aima.core.logic.propositional.algorithms.PLResolution
  • aima.core.logic.propositional.algorithms.TTEntails
  • aima.core.logic.propositional.algorithms.WalkSAT
  • aima.core.logic.propositional.parsing.AbstractPLVisitor
  • aima.core.logic.propositional.parsing.PEParser
  • aima.core.logic.propositional.visitors.SymbolCollector
  • aima.test.core.unit.logic.propositional.algorithms.DPLLTest
  • aima.test.core.unit.logic.propositional.algorithms.ModelTest
    • 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.