Examples of PLResolution

aima.core.logic.propositional.algorithms.PLResolution

Artificial Intelligence A Modern Approach (3rd Edition): page 255.

  function PL-RESOLUTION(KB, α) returns true or false inputs: KB, the knowledge base, a sentence in propositional logic α, the query, a sentence in propositional logic clauses ← the set of clauses in the CNF representation of KB ∧ ¬α new ← {} loop do for each pair of clauses C_i, C_j in clauses do resolvents ← PL-RESOLVE(C_i, C_j) if resolvents contains the empty clause then return true new ← new ∪ resolvents if new ⊆ clauses then return false clauses ← clauses ∪ new

Figure 7.12 A simple resolution algorithm for propositional logic. The function PL-RESOLVE returns the set of all possible clauses obtained by resolving its two inputs. @author Ravi Mohan @author Mike Stampone


  private PEParser parser;


  @Before
  public void setUp() {
    resolution = new PLResolution();
    parser = new PEParser();
  }

  }


  @Test
  public void testMultipleClauseResolution() {
    // test (and fix) suggested by Huy Dinh. Thanks Huy!
    PLResolution plr = new PLResolution();
    KnowledgeBase kb = new KnowledgeBase();
    String fact = "((B11 <=> (P12 OR P21)) AND (NOT B11))";
    kb.tell(fact);
    plr.plResolution(kb, "(B)");
  }

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.

Examples of PLResolution

Examples of aima.core.logic.propositional.algorithms.PLResolution

Examples of aima.core.logic.propositional.algorithms.PLResolution