Fetching the paper…
Reading the bibliography…
We compare the impact of hardware advancement and algorithm advancement for SAT solving over the last two decades.
A computing procedure for quantification theory
Davis, M., and Putnam, H · 1960
Earlier work this paper cites.
A machine program for theorem-proving
Davis, M., Logemann, G., and Loveland, D · 1962
Earlier work this paper cites.
Cramming more components onto integrated circuits
Moore, G. E · 1965
Earlier work this paper cites.
The GNU manifesto
Stallman, R · 1985
Earlier work this paper cites.
A rearrangement search strategy for determining propositional satisfiability
Zabih, R., and McAllester, D. A · 1988
Earlier work this paper cites.
Satisfiability and maximum satisfiability descriptions, readings, problems
Trick, M., Chvátal, V., Cook, B., Johnson, D., McGeoch, C., and Tarjan, B · 1992
Earlier work this paper cites.
Report on a SAT competition
Büning, H. K., and Buro, M · 1993
Earlier work this paper cites.
Experimental results on the crossover point in satisfiability problems
Crawford, J. M., and Auton, L. D · 1993
Earlier work this paper cites.
Satisfiability suggested format
Johnson, D., and Trick, M · 1993
Earlier work this paper cites.
Optimal speedup of las vegas algorithms
Luby, M., Sinclair, A., and Zuckerman, D · 1993
Earlier work this paper cites.
The 2nd DIMACS implementation challenge: 1992–1993 on NP hard problems: Maximum clique, graph coloring, and satisfiability
Trick, M., Chvatal, V., Cook, B., Johnson, D., McGeoch, C., and Tarjan, B · 1993
Earlier work this paper cites.
Improvements to Propositional Satisfiability Search Algorithms
Freeman, J. W · 1995
Earlier work this paper cites.
GRASP - a new search algorithm for satisfiability
Silva, J. P. M., and Sakallah, K. A · 1996
Earlier work this paper cites.
Using CSP look-back techniques to solve real-world sat instances
Bayardo, R. J., and Schrag, R. C · 1997
Earlier work this paper cites.
Heuristics based on unit propagation for satisfiability problems
Li, C. M., and Anbulagan, A · 1997
Earlier work this paper cites.
Sato: An efficient propositional prover
Zhang, H · 1997
Earlier work this paper cites.
Boosting combinatorial search through randomization
Gomes, C. P., Selman, B., and Kautz, H. A · 1998
Earlier work this paper cites.
The processor-memory bottleneck: Problems and solutions
Mahapatra, N. R., and Venkatrao, B · 1999
Earlier work this paper cites.
Counting models using connected components
Jr., R. J. B., and Pehoushek, J. D · 2000
Earlier work this paper cites.
Chaff: Engineering an efficient SAT solver
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., and Malik, S · 2001
Earlier work this paper cites.
Solving real-world linear programs: A decade and more of progress
Bixby, R. E · 2002
Earlier work this paper cites.
Efficient algorithms for clause-learning sat solvers
Ryan, L · 2002
Earlier work this paper cites.
The SAT2002 competition (preliminary draft)
Simon, L., Berre, D. L., and Hirsch, E. A · 2002
Earlier work this paper cites.
An extensible SAT-solver
Eén, N., and Sörensson, N · 2003
Earlier work this paper cites.
The siege SAT solver
Ryan, L · 2003
Earlier work this paper cites.
Effective preprocessing in SAT through variable and clause elimination
Eén, N., and Biere, A · 2005
Earlier work this paper cites.
Speedup techniques utilized in modern SAT solvers
Lewis, M. D. T., Schubert, T., and Becker, B · 2005
Earlier work this paper cites.
A SAT solver primer
Mitchell, D. G · 2005
Earlier work this paper cites.
Minisat v1.13 – a SAT solver with conflict clause minimization
Sörensson, N., and Een, N · 2005
Earlier work this paper cites.
A lightweight component caching scheme for satisfiability solvers
Pipatsrisawat, K., and Darwiche, A · 2007
Earlier work this paper cites.
Chapter 2: Satisfiability solvers
Gomes, C. P., Kautz, H., Sabharwal, A., and Selman, B · 2008
Earlier work this paper cites.
Predicting learnt clauses quality in modern SAT solvers
Audemard, G., and Simon, L · 2009
Earlier work this paper cites.
Handbook of Satisfiability
Biere, A., Heule, M., van Maaren, H., and Walsh, T · 2009
Cited alongside, same era.
Cache conscious data structures for Boolean satisfiability solvers
Chu, G., Harwood, A., and Stuckey, P · 2009
Cited alongside, same era.
Chapter 1: A history of satisfiability
Franco, J., and Martin, J · 2009
Cited alongside, same era.
Chapter 4: Conflict-driven clause learning sat solvers
Marques-Silva, J., Lynce, I., and Malik, S · 2009
Cited alongside, same era.
On the power of clause-learning sat solvers with restarts
Pipatsrisawat, K., and Darwiche, A · 2009
Cited alongside, same era.
Dram errors in the wild: A large-scale field study
Schroeder, B., Pinheiro, E., and Weber, W.-D · 2009
Cited alongside, same era.
The science of brute force
Heule, M. J. H., and Kullmann, O · 2017
Later among the works it cites.
Divide and conquer: Towards faster pseudo-boolean solving
Elffers, J., and Nordström, J · 2018
Later among the works it cites.
Schur number five
Heule, M. J. H · 2018
Later among the works it cites.
The CryptoMiniSat 5.5 set of solvers at the SAT Competition 2018
Soos, M · 2018
Later among the works it cites.
Benchmarking crimes: An emerging threat in systems security
van der Kouwe, E., Andriesse, D., Bos, H., Giuffrida, C., and Heiser, G · 2018
Later among the works it cites.
Glucose in the SAT Race 2019
Audemard, G., and Simon, L · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Automated testing and debugging of sat and qbf solvers
Brummayer, R., Lonsing, F., and Biere, A · 2010
Cited alongside, same era.
Enhanced Gaussian elimination in DPLL-based SAT solvers
Soos, M · 2010
Cited alongside, same era.
Computer Architecture: A Quantitative Approach
Hennessy, J. L., and Patterson, D. A · 2011
Cited alongside, same era.
Empirical study of the anatomy of modern SAT solvers
Katebi, H., Sakallah, K. A., and Marques-Silva, J. P · 2011
Cited alongside, same era.
Controlling a solver execution with the runsolver tool
Roussel, O · 2011
Cited alongside, same era.
Anatomy and empirical evaluation of modern SAT solvers
Sakallah, K. A., and Marques-Silva, J · 2011
Cited alongside, same era.
Reliable benchmarking: requirements and solutions
Beyer, D., Löwe, S., and Wendler, P · 2019
Later among the works it cites.
CaDiCaL simplified satisfiability solver
Biere, A · 2019
Later among the works it cites.
Debian 10 buster released
Carter, J · 2019
Later among the works it cites.
On division versus saturation in pseudo-boolean solving
Gocht, S., Nordström, J., and Yehudayoff, A · 2019
Later among the works it cites.
Memory efficient parallel sat solving with inprocessing
Iser, M., Balyo, T., and Sinz, C · 2019
Later among the works it cites.
Debian gnu/linux installation guide: 2.1. supported hardware
Jackson, I., Schwarz, C., and Morris, D. A · 2019
Later among the works it cites.
MapleLCMDistChronoBT-DL, duplicate learnts heuristic-aided solvers at the SAT Race 2019
Kochemazov, S., Zaikin, O., Kondratiev, V., and Semenov, A · 2019
Later among the works it cites.
The theorem prover museum – conserving the system heritage of automated reasoning
Kohlhase, M · 2019
Later among the works it cites.
xkcd2268
Munroe, R · 2019
Later among the works it cites.
Software citations now available in zenodo
Nielsen, L. H · 2019
Later among the works it cites.
Energy efficiency features of the Intel Skylake-SP processor and their impact on performance
Schöne, R., Ilsche, T., Bielert, M., Gocht, A., and Hackenberg, D · 2019
Later among the works it cites.
SAT heritage: A community-driven effort for archiving, building and running more than thousand sat solvers
Audemard, G., Paulevé, L., and Simon, L · 2020
Closest in time.
Correctness of old SAT solvers
Biere, A · 2020
Closest in time.
The resolution of keller’s conjecture
Brakensiek, J., Heule, M., Mackey, J., and Narváez, D · 2020
Closest in time.
Software heritage
Cosmo, R. D., Zacchiroli, S., Berry, G., Abramatic, J.-F., Lawall, J., and Abiteboul, S · 2020
Closest in time.
Analyzed Benchmarks and Raw Data on Experiments for Time Leap Challenge for SAT-Solving (Dataset)
Fichte, J. K., Hecher, M., and Szeider, S · 2020
Closest in time.
A time leap challenge for sat-solving
Fichte, J. K., Hecher, M., and Szeider, S · 2020
Closest in time.
Towards faster reasoners by using transparent huge pages
Fichte, J. K., Manthey, N., Schidler, A., and Stecklina, J · 2020
Closest in time.
High-performance computer (hpc-cluster) taurus
for Information Services, C., and at TU Dresden, H. Z · 2020
Closest in time.
The international sat competition web page
Heule, M., Järvisalo, M., Suda, M., Iser, M., Balyo, T., et al · 2020
Closest in time.
SATLIB – benchmark problems
Hoos, H. H · 2020
Closest in time.
SATLIB – solvers
Hoos, H. H · 2020
Closest in time.
Internet archive
Kahle, B · 2020
Closest in time.
Grasp (SAT solver)
Marques-Silva, J · 2020
Closest in time.
The NetBSD project
the NetBSD www team · 2020
Closest in time.
Sourceforge — Wikipedia, the free encyclopedia
Wikipedia contributors · 2020
Closest in time.