Solving difficult SAT instances in the presence of symmetry

Abstract

Research in algorithms for Boolean satisfiability and their implementations [23, 6] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks [10] can be solved in seconds on commodity PCs. More recent benchmarks take longer to solve because of their large size, but are still solved in minutes [25]. Yet, small and difficult SAT… (More)
DOI: 10.1145/513918.514102
View Slides

4 Figures and Tables

Topics

Statistics

01020'03'05'07'09'11'13'15'17
Citations per Year

166 Citations

Semantic Scholar estimates that this publication has 166 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics