@inproceedings{ClauseckerReinefeld2019, author = {Clausecker, Robert and Reinefeld, Alexander}, title = {Zero-Aware Pattern Databases with 1-Bit Compression for Sliding Tile Puzzles}, booktitle = {Proceedings of the Twelfth International Symposium on Combinatorial Search (SoCS 2019)}, pages = {35 -- 43}, year = {2019}, language = {en} } @inproceedings{ClauseckerKaiser2021, author = {Clausecker, Robert and Kaiser, Benjamin}, title = {Sliding Tile Puzzles}, booktitle = {Proceedings of SAT Competition 2021 : Solver and Benchmark Descriptions}, pages = {57}, year = {2021}, language = {en} } @inproceedings{KaiserClauseckerMavroskoufis2023, author = {Kaiser, Benjamin and Clausecker, Robert and Mavroskoufis, Michael}, title = {Prioritised Unit Propagation by Partitioning the Watch Lists}, volume = {3545}, booktitle = {Proceedings of the 14th International Workshop on Pragmatics of SAT co-located with the 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)}, publisher = {CEUR Workshop Proceedings}, pages = {14 -- 34}, year = {2023}, abstract = {Conflict Driven Clause Learning (CDCL) SAT solvers spend most of their execution time iterating through clauses in unit propagation. Efficient implementations of unit propagation mostly rely on the two watched literals (TWL) scheme, a specialised data structure watching two literals per clause to prevent as many clause lookups as possible. In this paper, we present Priority Propagation (PriPro)—a minimally invasive method to adapt unit propagation in existing SAT solvers. With PriPro the traditional TWL scheme is partitioned to allow for rearranging the order in which clauses are examined. This is used to achieve a prioritisation of certain clauses. Using PriPro in combination with a dynamic heuristic to prioritise resolvents from recent conflicts, the effectiveness of unit propagation can be increased. In the state-of-the-art CDCL SAT solver CaDiCaL modified to use PriPro, we obtained a 5-10 \% speedup on the SAT Competition 2021 benchmark set in a fair comparison with the unmodified CaDiCaL.}, language = {en} } @inproceedings{ClauseckerSchintke2021, author = {Clausecker, Robert and Schintke, Florian}, title = {A Measure of Quality for IDA* Heuristics}, booktitle = {Proceedings of the Fourteenth International Symposium on Combinatorial Search (SoCS 2021)}, pages = {55 -- 63}, year = {2021}, language = {en} } @inproceedings{KaiserClausecker2021, author = {Kaiser, Benjamin and Clausecker, Robert}, title = {CleanMaple}, booktitle = {Proceedings of SAT Competition 2021 : Solver and Benchmark Descriptions}, pages = {24}, year = {2021}, language = {en} } @inproceedings{KaiserClausecker2021, author = {Kaiser, Benjamin and Clausecker, Robert}, title = {CleanMaple_PriPro, CaDiCaL_PriPro and CaDiCaL_PriPro_no_bin}, booktitle = {Proceedings of SAT Competition 2021 : Solver and Benchmark Descriptions}, pages = {25}, year = {2021}, language = {en} }