Arrow Research search
Back to LPAR

LPAR 2023

Analyzing Multiple Conflicts in SAT: An Experimental Evaluation

Conference Paper Accepted Paper Artificial Intelligence · Logic in Computer Science

Abstract

Unit propagation and conflict analysis are two essential ingredients of CDCL SAT Solving. The order in which unit propagation is computed does not matter when no conflict is found, because it is well known that there exists a unique unit-propagation fixpoint. However, when a conflict is found, current CDCL implementations stop and analyze that concrete conflict, even though other conflicts may exist in the unit-propagation closure. In this experimental evaluation, we report on our experience in modifying this concrete aspect in the CaDiCaL SAT Solver and try to answer the question of whether we can improve the performance of SAT Solvers by the analysis of multiple conflicts.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Archive span
1992-2024
Indexed papers
780
Paper id
12480885400119827
v2026.09.13