External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers

Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter, Michael W. Whalen. Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers. In Sriram Sankaranarayanan 0001, Natasha Sharygina, editors, Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part I. Volume 13993 of Lecture Notes in Computer Science, pages 348-366, Springer, 2023. [doi]

Authors

Dawn Michaelson

This author has not been identified. Look up 'Dawn Michaelson' in Google

Dominik Schreiber

This author has not been identified. Look up 'Dominik Schreiber' in Google

Marijn J. H. Heule

This author has not been identified. Look up 'Marijn J. H. Heule' in Google

Benjamin Kiesl-Reiter

This author has not been identified. Look up 'Benjamin Kiesl-Reiter' in Google

Michael W. Whalen

This author has not been identified. Look up 'Michael W. Whalen' in Google
runs on