Analyzing Multiple Conflicts in SAT: An Experimental Evaluation

11 pages•Published: June 3, 2023

Albert Oliveras, Enric Rodríguez Carbonell and Rui Zhao

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.

Keyphrases: conflict analysis, experimental evaluation, sat

In: Ruzica Piskac and Andrei Voronkov (editors). Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 94, pages 306-316.

Links:	https://easychair.org/publications/paper/8DDd
	https://doi.org/10.29007/fj74

BibTeX entry

@inproceedings{LPAR2023:Analyzing_Multiple_Conflicts_SAT,
  author    = {Albert Oliveras and Enric Rodríguez Carbonell and Rui Zhao},
  title     = {Analyzing Multiple Conflicts in SAT: An Experimental Evaluation},
  booktitle = {Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Ruzica Piskac and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {94},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/8DDd},
  doi       = {10.29007/fj74},
  pages     = {306-316},
  year      = {2023}}

Download PDF Open PDF in browser