Csr2011 june15 11_30_sokolov
FOL resolution strategies Tuomas Sandholm Carnegie Mellon University Computer Science Department [Finish reading Russell & Norvig Chapter 9 if you haven’t.
Resolution Strategies One common strategy for applying resolution is called level saturation. Here you try to resolve every pair of clauses from the original.
Logical Foundations of AI SAT Henry Kautz. Resolution Refutation Proof DAG, where leaves are input clauses Internal nodes are resolvants Root is false.
Non-clausal Reasoning
“Predicting Learnt Clauses Quality in Modern SAT Solvers” & “Blocked Clause Elimination” Ateeq Sharfuddin CS 297: Championship Algorithms.
