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

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

75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
   *            a question to ASK the knowledge base
   *
   * @return the answer to the specified question using the DPLL algorithm.
   */
  public boolean askWithDpll(String queryString) {
    Sentence query = null, cnfForm = null;
    try {
      // just a check to see that the query is well formed
      query = (Sentence) parser.parse(queryString);
    } catch (Exception e) {
      System.out.println("error parsing query" + e.getMessage());
    }

    Sentence kbSentence = asSentence();
    Sentence kbPlusQuery = null;
    if (kbSentence != null) {
      kbPlusQuery = (Sentence) parser.parse(" ( " + kbSentence.toString()
          + " AND (NOT " + queryString + " ))");
    } else {
      kbPlusQuery = query;
View Full Code Here
63
64
65
66
67
68
69
70
    }
  }

  private UnarySentence parseNotSentence() {
    match("NOT");
    Sentence sen = parseSentence();
    return new UnarySentence(sen);
  }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
    consume();
    String connector = lookAhead(1).getText();
    consume();
    List<Sentence> sentences = new ArrayList<Sentence>();
    while (lookAhead(1).getType() != LogicTokenTypes.RPAREN) {
      Sentence sen = parseSentence();
      // consume();
      sentences.add(sen);
    }
    match(")");
    return new MultiSentence(connector, sentences);
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
    if (detectMultiOperator()) {
      return parseMultiSentence();
    } else {
      match("(");
      Sentence one = parseSentence();
      if (lookAhead(1).getType() == LogicTokenTypes.RPAREN) {
        match(")");
        return one;
      } else if ((lookAhead(1).getType() == LogicTokenTypes.CONNECTOR)
          && (!(lookAhead(1).getText().equals("Not")))) {
        String connector = lookAhead(1).getText();
        consume(); // connector
        Sentence two = parseSentence();
        match(")");
        return new BinarySentence(connector, one, two);
      }

    }
View Full Code Here
36
37
38
39
40
41
42
43
44
  @Test
  public void testDPLLReturnsTrueWhenAllClausesTrueInModel() {
    Model model = new Model();
    model = model.extend(new Symbol("A"), true).extend(new Symbol("B"),
        true);
    Sentence sentence = (Sentence) parser.parse("((A AND B) AND (A OR B))");
    boolean satisfiable = dpll.dpllSatisfiable(sentence, model);
    Assert.assertEquals(true, satisfiable);
  }
View Full Code Here
46
47
48
49
50
51
52
53
54
  @Test
  public void testDPLLReturnsFalseWhenOneClauseFalseInModel() {
    Model model = new Model();
    model = model.extend(new Symbol("A"), true).extend(new Symbol("B"),
        false);
    Sentence sentence = (Sentence) parser.parse("((A OR B) AND (A => B))");
    boolean satisfiable = dpll.dpllSatisfiable(sentence, model);
    Assert.assertEquals(false, satisfiable);
  }
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
  @Test
  public void testDPLLFiltersClausesTheStatusOfWhichAreKnown() {
    Model model = new Model();
    model = model.extend(new Symbol("A"), true).extend(new Symbol("B"),
        true);
    Sentence sentence = (Sentence) parser
        .parse("((A AND B) AND (B AND C))");
    List<Sentence> clauseList = new Converter<Sentence>()
        .setToList(new CNFClauseGatherer()
            .getClausesFrom(new CNFTransformer()
                .transform(sentence)));
    List<Sentence> clausesWithNonTrueValues = dpll
        .clausesWithNonTrueValues(clauseList, model);
    Assert.assertEquals(1, clausesWithNonTrueValues.size());
    Sentence nonTrueClause = (Sentence) parser.parse("(B AND C)");
    clausesWithNonTrueValues.contains(nonTrueClause);
  }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
  @Test
  public void testDPLLFilteringNonTrueClausesGivesNullWhenAllClausesAreKnown() {
    Model model = new Model();
    model = model.extend(new Symbol("A"), true)
        .extend(new Symbol("B"), true).extend(new Symbol("C"), true);
    Sentence sentence = (Sentence) parser
        .parse("((A AND B) AND (B AND C))");
    List<Sentence> clauseList = new Converter<Sentence>()
        .setToList(new CNFClauseGatherer()
            .getClausesFrom(new CNFTransformer()
                .transform(sentence)));
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
  @Test
  public void testDPLLFindsPurePositiveSymbolsWhenTheyExist() {
    Model model = new Model();
    model = model.extend(new Symbol("A"), true).extend(new Symbol("B"),
        true);
    Sentence sentence = (Sentence) parser
        .parse("((A AND B) AND (B AND C))");
    List<Sentence> clauseList = new Converter<Sentence>()
        .setToList(new CNFClauseGatherer()
            .getClausesFrom(new CNFTransformer()
                .transform(sentence)));
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
  @Test
  public void testDPLLFindsPureNegativeSymbolsWhenTheyExist() {
    Model model = new Model();
    model = model.extend(new Symbol("A"), true).extend(new Symbol("B"),
        true);
    Sentence sentence = (Sentence) parser
        .parse("((A AND B) AND ( B  AND (NOT C) ))");
    List<Sentence> clauseList = new Converter<Sentence>()
        .setToList(new CNFClauseGatherer()
            .getClausesFrom(new CNFTransformer()
                .transform(sentence)));
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.