Unsatisfiability proofs for distributed clause-sharing SAT solvers. Michaelson, D., Schreiber, D., Heule, M. J. H., Kiesl-Reiter, B., & Whalen, M. W. In Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 348–366, 2023. Springer. (Nominated for a best paper award)
Unsatisfiability proofs for distributed clause-sharing SAT solvers [pdf]Pdf  Unsatisfiability proofs for distributed clause-sharing SAT solvers [pdf]Slides  doi  bibtex   

Downloads: 0