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

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

66
67
68
69
70
71
72
73
74
75
76
77
78
79
  }

  private Symbol getSymbolWhoseFlipMaximisesSatisfiedClauses(
      Set<Sentence> clauses, List<Symbol> symbols, Model model) {
    if (symbols.size() > 0) {
      Symbol retVal = symbols.get(0);
      int maxClausesSatisfied = 0;
      for (int i = 0; i < symbols.size(); i++) {
        Symbol sym = symbols.get(i);
        if (getNumberOfClausesSatisfiedIn(clauses, model.flip(sym)) > maxClausesSatisfied) {
          retVal = sym;
          maxClausesSatisfied = getNumberOfClausesSatisfiedIn(
              clauses, model.flip(sym));
        }
View Full Code Here
14
15
16
17
18
19
20
21
  @SuppressWarnings("unchecked")
  @Override
  public Object visitSymbol(Symbol s, Object arg) {
    Set<Symbol> symbolsCollectedSoFar = (Set<Symbol>) arg;
    symbolsCollectedSoFar.add(new Symbol(s.getValue()));
    return symbolsCollectedSoFar;
  }
View Full Code Here
17
18
19
20
21
22
23
*/
public class AbstractPLVisitor implements PLVisitor {
  private PEParser parser = new PEParser();

  public Object visitSymbol(Symbol s, Object arg) {
    return new Symbol(s.getValue());
  }
View Full Code Here
44
45
46
47
48
49
50
  }

  private Symbol parseSymbol() {
    String sym = lookAhead(1).getText();
    consume();
    return new Symbol(sym);
  }
View Full Code Here
34
35
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
44
45
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
54
55
56
57
58
59
60
61
62
63
64
  }

  @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()
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
  }

  @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()
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
  }

  @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)));
    List<Symbol> symbolList = new Converter<Symbol>()
        .setToList(new SymbolCollector().getSymbolsIn(sentence));

    DPLL.SymbolValuePair sv = dpll.findPureSymbolValuePair(clauseList,
        model, symbolList);
    Assert.assertNotNull(sv);
    Assert.assertEquals(new Symbol("C"), sv.symbol);
    Assert.assertEquals(new Boolean(true), sv.value);
  }
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
  }

  @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)));
    List<Symbol> symbolList = new Converter<Symbol>()
        .setToList(new SymbolCollector().getSymbolsIn(sentence));

    DPLL.SymbolValuePair sv = dpll.findPureSymbolValuePair(clauseList,
        model, symbolList);
    Assert.assertNotNull(sv);
    Assert.assertEquals(new Symbol("C"), sv.symbol);
    Assert.assertEquals(new Boolean(false), sv.value);
  }
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.