Published in: LIPIcs, Volume 271, 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)
Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, and Marijn J. H. Heule. Certified Knowledge Compilation with Application to Verified Model Counting. In 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 271, pp. 6:1-6:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{bryant_et_al:LIPIcs.SAT.2023.6, author = {Bryant, Randal E. and Nawrocki, Wojciech and Avigad, Jeremy and Heule, Marijn J. H.}, title = {{Certified Knowledge Compilation with Application to Verified Model Counting}}, booktitle = {26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)}, pages = {6:1--6:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-286-0}, ISSN = {1868-8969}, year = {2023}, volume = {271}, editor = {Mahajan, Meena and Slivovsky, Friedrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.6}, URN = {urn:nbn:de:0030-drops-184685}, doi = {10.4230/LIPIcs.SAT.2023.6}, annote = {Keywords: Propositional model counting, Proof checking} }
Published in: LIPIcs, Volume 271, 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)
Andrew Haberlandt, Harrison Green, and Marijn J. H. Heule. Effective Auxiliary Variables via Structured Reencoding. In 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 271, pp. 11:1-11:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{haberlandt_et_al:LIPIcs.SAT.2023.11, author = {Haberlandt, Andrew and Green, Harrison and Heule, Marijn J. H.}, title = {{Effective Auxiliary Variables via Structured Reencoding}}, booktitle = {26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)}, pages = {11:1--11:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-286-0}, ISSN = {1868-8969}, year = {2023}, volume = {271}, editor = {Mahajan, Meena and Slivovsky, Friedrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.11}, URN = {urn:nbn:de:0030-drops-184736}, doi = {10.4230/LIPIcs.SAT.2023.11}, annote = {Keywords: Reencoding, Auxiliary Variables, Extended Resolution} }
Published in: LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Emre Yolcu and Marijn J. H. Heule. Exponential Separations Using Guarded Extension Variables. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 101:1-101:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{yolcu_et_al:LIPIcs.ITCS.2023.101, author = {Yolcu, Emre and Heule, Marijn J. H.}, title = {{Exponential Separations Using Guarded Extension Variables}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {101:1--101:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-263-1}, ISSN = {1868-8969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.101}, URN = {urn:nbn:de:0030-drops-176043}, doi = {10.4230/LIPIcs.ITCS.2023.101}, annote = {Keywords: proof complexity, separations, resolution, extended resolution, blocked clauses} }
Published in: LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Leroy Chew and Marijn J. H. Heule. Relating Existing Powerful Proof Systems for QBF. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 236, pp. 10:1-10:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{chew_et_al:LIPIcs.SAT.2022.10, author = {Chew, Leroy and Heule, Marijn J. H.}, title = {{Relating Existing Powerful Proof Systems for QBF}}, booktitle = {25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)}, pages = {10:1--10:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-242-6}, ISSN = {1868-8969}, year = {2022}, volume = {236}, editor = {Meel, Kuldeep S. and Strichman, Ofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.10}, URN = {urn:nbn:de:0030-drops-166845}, doi = {10.4230/LIPIcs.SAT.2022.10}, annote = {Keywords: QBF, Proof Complexity, Verification, Strategy Extraction, Sequent Calculus} }
Published in: LIPIcs, Volume 236, 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Armin Biere, Md Solimul Chowdhury, Marijn J. H. Heule, Benjamin Kiesl, and Michael W. Whalen. Migrating Solver State. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 236, pp. 27:1-27:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{biere_et_al:LIPIcs.SAT.2022.27, author = {Biere, Armin and Chowdhury, Md Solimul and Heule, Marijn J. H. and Kiesl, Benjamin and Whalen, Michael W.}, title = {{Migrating Solver State}}, booktitle = {25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)}, pages = {27:1--27:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-242-6}, ISSN = {1868-8969}, year = {2022}, volume = {236}, editor = {Meel, Kuldeep S. and Strichman, Ofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2022.27}, URN = {urn:nbn:de:0030-drops-167015}, doi = {10.4230/LIPIcs.SAT.2022.27}, annote = {Keywords: SAT, SMT, Cloud Computing, Serverless Computing} }
Published in: LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022)
Marijn J. H. Heule, Anthony Karahalios, and Willem-Jan van Hoeve. From Cliques to Colorings and Back Again. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 235, pp. 26:1-26:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{heule_et_al:LIPIcs.CP.2022.26, author = {Heule, Marijn J. H. and Karahalios, Anthony and van Hoeve, Willem-Jan}, title = {{From Cliques to Colorings and Back Again}}, booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)}, pages = {26:1--26:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-240-2}, ISSN = {1868-8969}, year = {2022}, volume = {235}, editor = {Solnon, Christine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2022.26}, URN = {urn:nbn:de:0030-drops-166558}, doi = {10.4230/LIPIcs.CP.2022.26}, annote = {Keywords: Graph coloring, maximum clique, Boolean satisfiability} }
Feedback for Dagstuhl Publishing