# New Boolean satisfiability problem heuristic strategy: Minimal Positive Negative Product Strategy

arXiv: https://arxiv.org/abs/2310.18370 · HTML: https://mlsanity.com/paper/2310.18370/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 13 references that are in the map.
- First posted on arXiv 26 Oct 2023.

## Builds on (most cited first, 1 of 1)

- [Too much information: why CDCL solvers need to forget learned clauses](https://mlsanity.com/paper/2202.01030/) (2022)

## Abstract (arXiv)

This study presents a novel heuristic algorithm called the "Minimal Positive Negative Product Strategy" to guide the CDCL algorithm in solving the Boolean satisfiability problem. It provides a mathematical explanation for the superiority of this algorithm over widely used heuristics such as the Dynamic Largest Individual Sum (DLIS) and the Variable State Independent Decaying Sum (VSIDS). Experimental results further confirm the effectiveness of this heuristic strategy in problem-solving.