Published in: LIPIcs, Volume 340, 31st International Conference on Principles and Practice of Constraint Programming (CP 2025)
Zhengyuan Shi, Wentao Jiang, Xindi Zhang, Jin Luo, Yun Liang, Zhufei Chu, and Qiang Xu. DynamicSAT: Dynamic Configuration Tuning for SAT Solving. In 31st International Conference on Principles and Practice of Constraint Programming (CP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 340, pp. 34:1-34:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{shi_et_al:LIPIcs.CP.2025.34, author = {Shi, Zhengyuan and Jiang, Wentao and Zhang, Xindi and Luo, Jin and Liang, Yun and Chu, Zhufei and Xu, Qiang}, title = {{DynamicSAT: Dynamic Configuration Tuning for SAT Solving}}, booktitle = {31st International Conference on Principles and Practice of Constraint Programming (CP 2025)}, pages = {34:1--34:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-380-5}, ISSN = {1868-8969}, year = {2025}, volume = {340}, editor = {de la Banda, Maria Garcia}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.34}, URN = {urn:nbn:de:0030-drops-238952}, doi = {10.4230/LIPIcs.CP.2025.34}, annote = {Keywords: Boolean satisfiability problem, configuration tuning, multi-armed bandit} }
Published in: LIPIcs, Volume 210, 27th International Conference on Principles and Practice of Constraint Programming (CP 2021)
Shaowei Cai, Chuan Luo, Xindi Zhang, and Jian Zhang. Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 5:1-5:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cai_et_al:LIPIcs.CP.2021.5, author = {Cai, Shaowei and Luo, Chuan and Zhang, Xindi and Zhang, Jian}, title = {{Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization}}, booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)}, pages = {5:1--5:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-211-2}, ISSN = {1868-8969}, year = {2021}, volume = {210}, editor = {Michel, Laurent D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2021.5}, URN = {urn:nbn:de:0030-drops-152969}, doi = {10.4230/LIPIcs.CP.2021.5}, annote = {Keywords: Satisfiability, Local Search, Unit Propagation, Mathematical Problems} }