ExplorationsinArtificialIntelligence.pptVIP

Explorations in Artificial Intelligence Prof. Carla P. Gomes gomes@cs.cornell.edu Module 3 Logic Representations Part 2 Satisfiability Propositional Satisfiability problem Satifiability SAT : Given a formula in propositional calculus, is there a model i.e., a satisfying interpretation, an assignment to its variables making it true? We consider clausal form, e.g.: a ? ?b ? ? c AND b ? ? c AND a ? c Effective propositional inference Two families of algorithms for propositional inference checking satisfiability based on model checking which are quite effective in practice : Complete backtracking search algorithms DPLL algorithm Davis, Putnam, Logemann, Loveland Incomplete local search algorithms WalkSAT algorithm The DPLL algorithm Determine if an input propositional logic sentence in CNF is satisfiable. Improvements over truth table enumeration: Early termination A clause is true if any literal is true. A sentence is false if any clause is false. Pure symbol heuristic Pure symbol: always appears with the same sign in all clauses. e.g., In the three clauses A ? ?B , ?B ? ?C , C ? A , A and B are pure, C is impure. Make a pure symbol literal true. Unit clause heuristic Unit clause: only one literal in the clause The only literal in a unit clause must be true. The DPLL algorithm The WalkSAT algorithm Incomplete, local search algorithm Evaluation function: The min-conflict heuristic of minimizing the number of unsatisfied clauses Balance between greediness and randomness The WalkSAT algorithm Hard satisfiability problems Consider random 3-CNF sentences. e.g., ?D ? ?B ? C ? B ? ?A ? ?C ? ?C ? ?B ? E ? E ? ?D ? B ? B ? E ? ?C m number of clauses n number of symbols Hard problems seem to cluster near m/n 4.3 critical point Intuition At low ratios: few clauses constraints many assignments easily found At high ratios: many clauses inconsistencies easily detected Satisfiability as an Encoding L