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)Pdf Slides doi bibtex @InProceedings{michaelson2023unsatisfiability,
author = {Michaelson, Dawn and Schreiber, Dominik and Heule, Marijn J. H. and Kiesl-Reiter, Benjamin and Whalen, Michael W.},
title = {{Unsatisfiability proofs for distributed clause-sharing {SAT} solvers}},
booktitle = {Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)},
year = {2023},
organization = {Springer},
pages = {348--366},
doi = {10.1007/978-3-031-30823-9_18},
note={{(Nominated for a best paper award)}},
url_PDF={https://satres.kikit.kit.edu/papers/2023-unsatisfiability-accepted.pdf},
url_Slides={https://satres.kikit.kit.edu/slides/2023-tacas-unsatisfiability.pdf},
}
Downloads: 0
{"_id":"6cDSn9keAdA9MC4uZ","bibbaseid":"michaelson-schreiber-heule-kieslreiter-whalen-unsatisfiabilityproofsfordistributedclausesharingsatsolvers-2023","author_short":["Michaelson, D.","Schreiber, D.","Heule, M. J. H.","Kiesl-Reiter, B.","Whalen, M. W."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Michaelson"],"firstnames":["Dawn"],"suffixes":[]},{"propositions":[],"lastnames":["Schreiber"],"firstnames":["Dominik"],"suffixes":[]},{"propositions":[],"lastnames":["Heule"],"firstnames":["Marijn","J.","H."],"suffixes":[]},{"propositions":[],"lastnames":["Kiesl-Reiter"],"firstnames":["Benjamin"],"suffixes":[]},{"propositions":[],"lastnames":["Whalen"],"firstnames":["Michael","W."],"suffixes":[]}],"title":"Unsatisfiability proofs for distributed clause-sharing SAT solvers","booktitle":"Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","year":"2023","organization":"Springer","pages":"348–366","doi":"10.1007/978-3-031-30823-9_18","note":"(Nominated for a best paper award)","url_pdf":"https://satres.kikit.kit.edu/papers/2023-unsatisfiability-accepted.pdf","url_slides":"https://satres.kikit.kit.edu/slides/2023-tacas-unsatisfiability.pdf","bibtex":"@InProceedings{michaelson2023unsatisfiability,\n\tauthor = {Michaelson, Dawn and Schreiber, Dominik and Heule, Marijn J. H. and Kiesl-Reiter, Benjamin and Whalen, Michael W.},\n\ttitle = {{Unsatisfiability proofs for distributed clause-sharing {SAT} solvers}},\n\tbooktitle = {Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)},\n\tyear = {2023},\n\torganization = {Springer},\n\tpages = {348--366},\n\tdoi = {10.1007/978-3-031-30823-9_18},\n\tnote={{(Nominated for a best paper award)}},\n\turl_PDF={https://satres.kikit.kit.edu/papers/2023-unsatisfiability-accepted.pdf},\n\turl_Slides={https://satres.kikit.kit.edu/slides/2023-tacas-unsatisfiability.pdf},\n}\n\n","author_short":["Michaelson, D.","Schreiber, D.","Heule, M. J. H.","Kiesl-Reiter, B.","Whalen, M. W."],"key":"michaelson2023unsatisfiability","id":"michaelson2023unsatisfiability","bibbaseid":"michaelson-schreiber-heule-kieslreiter-whalen-unsatisfiabilityproofsfordistributedclausesharingsatsolvers-2023","role":"author","urls":{" pdf":"https://satres.kikit.kit.edu/papers/2023-unsatisfiability-accepted.pdf"," slides":"https://satres.kikit.kit.edu/slides/2023-tacas-unsatisfiability.pdf"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://satres.kikit.kit.edu/publications.bib","dataSources":["GbAhpS9MGKje2yeDe","vvHPGoxAbjPSzJtLK","fNbnZhh6uQMv7HBXF","JaqTjZbpCCeemC5uq","2uduD5h8PKoztN54h","6oCu7DG43gGpaCnhj"],"keywords":[],"search_terms":["unsatisfiability","proofs","distributed","clause","sharing","sat","solvers","michaelson","schreiber","heule","kiesl-reiter","whalen"],"title":"Unsatisfiability proofs for distributed clause-sharing SAT solvers","year":2023}