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

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

121
122
123
124
125
126
127
128
  }

  public boolean plResolution(String kbs, String alphaString) {
    KnowledgeBase kb = new KnowledgeBase();
    kb.tell(kbs);
    Sentence alpha = (Sentence) new PEParser().parse(alphaString);
    return plResolution(kb, alpha);
  }
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
      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)) {
View Full Code Here
190
191
192
193
194
195
196
197
198
199
200
201
    List<List<Sentence>> pairs = new ArrayList<List<Sentence>>();
    for (int i = 0; i < clausesList.size(); i++) {
      for (int j = i; j < clausesList.size(); j++) {
        List<Sentence> pair = new ArrayList<Sentence>();
        Sentence first = clausesList.get(i);
        Sentence second = clausesList.get(j);

        if (!(first.equals(second))) {
          pair.add(first);
          pair.add(second);
          pairs.add(pair);
View Full Code Here
27
28
29
30
31
32
33
34
    return dpllSatisfiable(s, new Model());
  }

  public boolean dpllSatisfiable(String string) {
    Sentence sen = (Sentence) new PEParser().parse(string);
    return dpllSatisfiable(sen, new Model());
  }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
  public List<Sentence> clausesWithNonTrueValues(List<Sentence> clauseList,
      Model model) {
    List<Sentence> clausesWithNonTrueValues = new ArrayList<Sentence>();
    for (int i = 0; i < clauseList.size(); i++) {
      Sentence clause = clauseList.get(i);
      if (!(isClauseTrueInModel(clause, model))) {
        if (!(clausesWithNonTrueValues.contains(clause))) {// defensive
          // programming not really necessary
          clausesWithNonTrueValues.add(clause);
        }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
  public SymbolValuePair findPureSymbolValuePair(List<Sentence> clauseList,
      Model model, List<Symbol> symbols) {
    List<Sentence> clausesWithNonTrueValues = clausesWithNonTrueValues(clauseList,
        model);
    Sentence nonTrueClauses = LogicUtils.chainWith("AND",
        clausesWithNonTrueValues);
    // System.out.println("Unsatisfied clauses = "
    // + clausesWithNonTrueValues.size());
    Set<Symbol> symbolsAlreadyAssigned = model.getAssignedSymbols();
View Full Code Here
160
161
162
163
164
165
166
167
168
169
170
        clauses, newSymbols, model.extend(symbol, false)));
  }

  private boolean isEvenOneClauseFalse(Model model, List<Sentence> clauseList) {
    for (int i = 0; i < clauseList.size(); i++) {
      Sentence clause = clauseList.get(i);
      if (model.isFalse(clause)) {
        // System.out.println(clause.toString() + " is false");
        return true;
      }
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
  }

  private boolean areAllClausesTrue(Model model, List<Sentence> clauseList) {

    for (int i = 0; i < clauseList.size(); i++) {
      Sentence clause = clauseList.get(i);
      // System.out.println("evaluating " + clause.toString());
      if (!isClauseTrueInModel(clause, model)) { // ie if false or
        // UNKNOWN
        // System.out.println(clause.toString()+ " is not true");
        return false;
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
  }

  private SymbolValuePair findUnitClause(List<Sentence> clauseList, Model model,
      List<Symbol> symbols) {
    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(
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
  }

  private List<HornClause> asHornClauses(List<Sentence> sentences) {
    List<HornClause> hornClauses = new ArrayList<HornClause>();
    for (int i = 0; i < sentences.size(); i++) {
      Sentence sentence = sentences.get(i);
      HornClause clause = new HornClause(sentence);
      hornClauses.add(clause);
    }
    return hornClauses;
  }
View Full Code Here
TOP

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

  • aima.core.logic.propositional.algorithms.DPLL
  • aima.core.logic.propositional.algorithms.KnowledgeBase
  • aima.core.logic.propositional.algorithms.LogicUtils
  • 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.CNFTransformer
    • 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.