The strength of the dominance rule

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F24%3A00598225" target="_blank" >RIV/67985840:_____/24:00598225 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.4230/LIPIcs.SAT.2024.20" target="_blank" >https://doi.org/10.4230/LIPIcs.SAT.2024.20</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.SAT.2024.20" target="_blank" >10.4230/LIPIcs.SAT.2024.20</a>

Result language

angličtina

Original language name

The strength of the dominance rule

Original language description

It has become standard that, when a SAT solver decides that a CNF Γ is unsatisfiable, it produces a certificate of unsatisfiability in the form of a refutation of Γ in some proof system. The system typically used is DRAT, which is equivalent to extended resolution (ER) - for example, until this year DRAT refutations were required in the annual SAT competition. Recently [Bogaerts et al. 2023] introduced a new proof system, associated with the tool VeriPB, which is at least as strong as DRAT and is further able to handle certain symmetry-breaking techniques. We show that this system simulates the proof system G1, which allows limited reasoning with QBFs and forms the first level above ER in a natural hierarchy of proof systems. This hierarchy is not known to be strict, but nevertheless this is evidence that the system of [Bogaerts et al. 2023] is plausibly strictly stronger than ER and DRAT. In the other direction, we show that symmetry-breaking for a single symmetry can be handled inside ER.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA23-04825S" target="_blank" >GA23-04825S: Logic and unsatisfiability</a><br>

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)

ISBN

978-3-95977-334-8

ISSN

—

e-ISSN

—

Number of pages

22

Pages from-to

20

Publisher name

Schloss Dagstuhl, Leibniz-Zentrum für Informatik

Place of publication

Dagstuhl

Event location

Pune

Event date

Aug 21, 2024

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—