Two Optimizations on the Stålmarck Procedure
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909797909004288 |
|---|---|
| author | Leonov, Sergei Davis, Liam |
| author_facet | Leonov, Sergei Davis, Liam |
| contents | In this paper, we introduce StalmarckSAT, the a modern re-implementation of the Stålmarck Procedure for SAT solving, and present two novel strategies to improve the Procedure, Cardinality Driven Branching (CDB) and Deductive Priority Ordering (DPO). CDB is a heuristic to improve branching with the dilemma rule, and DPO intelligently orders simple rules based on their deductive potential. Our results demonstrate improved solve times with both strategies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_16172 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Two Optimizations on the Stålmarck Procedure Leonov, Sergei Davis, Liam Logic in Computer Science In this paper, we introduce StalmarckSAT, the a modern re-implementation of the Stålmarck Procedure for SAT solving, and present two novel strategies to improve the Procedure, Cardinality Driven Branching (CDB) and Deductive Priority Ordering (DPO). CDB is a heuristic to improve branching with the dilemma rule, and DPO intelligently orders simple rules based on their deductive potential. Our results demonstrate improved solve times with both strategies. |
| title | Two Optimizations on the Stålmarck Procedure |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2509.16172 |