Heuristic-Based Backtracking for Propositional Satisfiability


In recent years backtrack search algorithms for Propositional Satisfiability (SAT) have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully solve instances with thousands of variables and hundreds of thousands of clauses, and also motivated the development of many new challenging problem instances, many of which… (More)
DOI: 10.1007/978-3-540-24580-3_19


  • Presentations referencing similar topics