TY - CONF A1 - Kaiser, Benjamin A1 - Clausecker, Robert A1 - Mavroskoufis, Michael T1 - Prioritised Unit Propagation by Partitioning the Watch Lists T2 - 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) N2 - 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. Y1 - 2023 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/9258 UR - https://ceur-ws.org/Vol-3545/paper2.pdf VL - 3545 SP - 14 EP - 34 PB - CEUR Workshop Proceedings ER -