数学逻辑分析-无原因推理 Non-clausal Reasoning.pptVIP

Non-clausal Reasoning Fahiem Bacchus, Christian Thiffault, Toronto Toby Walsh, UCC Uppsala (soon UNSW, NICTA, Uppsala) Every morning … I read the plaque on the wall of this house … Dedicated to the memory of George Boole … Professor of Mathematics at Queens College (now University College Cork) George Boole (1815-1864) Boolean algebra The Mathematical Analysis of Logic, Cambridge, 1847 The Calculus of Logic, Cambridge and Dublin Mathematical journal, 1848 Reduce propositional logic to algebraic manipulations George Boole (1815-1864) Boolean algebra The Mathematical Analysis of Logic, Cambridge, 1847 The Calculus of Logic, Cambridge and Dublin Mathematical journal, 1848 Reduce propositional logic to algebraic manipulations How do we automate reasoning with propositional formulae? Propositional SATisfiability Rapid progress being made 10 years ago, 50 vars Today, 1000 vars Algorithmic advances Learning Watched literals .. Heuristic advances VSIDS branching Propositional SATisfiability Efficient implementations Chaff, Berkmin, Forklift, … SAT competition has new winner almost every year Practical applications Hardware verification Planning … SAT folklore Need to solve in CNF Everything is a clause Efficient reasoning Optimize code with simple data structures … Effective reasoning Conversion into CNF does not hinder unit propagation Overturning SAT folklore Deciding arbitrary Boolean formulae Without converting into CNF Efficient reasoning Raw speed as good as optimized CNF solvers Effective reasoning More inference than unit propagation Exploit structure More exotic gates, … Davis Putnam procedure DPLL(S) if S empty then SAT if S contains {} then UNSAT if S contains unit, l then DPLL(S u {l}) else chose literal, l if DPLL(S u {l}) then SAT else DPLL(S u {-l}) Unit Propagation If the formula has a unit clause then the literal in that clause must be true Set the literal to true and reduce the formula. Unit propagation is the most com