DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916212337803264 |
|---|---|
| author | Feng, Nick Hu, Alan J. Bayless, Sam Iqbal, Syed M. Trentin, Patrick Whalen, Mike Pike, Lee Backes, John |
| author_facet | Feng, Nick Hu, Alan J. Bayless, Sam Iqbal, Syed M. Trentin, Patrick Whalen, Mike Pike, Lee Backes, John |
| contents | Generating proofs of unsatisfiability is a valuable capability of most SAT solvers, and is an active area of research for SMT solvers. This paper introduces the first method to efficiently generate proofs of unsatisfiability specifically for an important subset of SMT: SAT Modulo Monotonic Theories (SMMT), which includes many useful finite-domain theories (e.g., bit vectors and many graph-theoretic properties) and is used in production at Amazon Web Services. Our method uses propositional definitions of the theory predicates, from which it generates compact Horn approximations of the definitions, which lead to efficient DRAT proofs, leveraging the large investment the SAT community has made in DRAT. In experiments on practical SMMT problems, our proof generation overhead is minimal (7.41% geometric mean slowdown, 28.8% worst-case), and we can generate and check proofs for many problems that were previously intractable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_10703 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories Feng, Nick Hu, Alan J. Bayless, Sam Iqbal, Syed M. Trentin, Patrick Whalen, Mike Pike, Lee Backes, John Logic in Computer Science Generating proofs of unsatisfiability is a valuable capability of most SAT solvers, and is an active area of research for SMT solvers. This paper introduces the first method to efficiently generate proofs of unsatisfiability specifically for an important subset of SMT: SAT Modulo Monotonic Theories (SMMT), which includes many useful finite-domain theories (e.g., bit vectors and many graph-theoretic properties) and is used in production at Amazon Web Services. Our method uses propositional definitions of the theory predicates, from which it generates compact Horn approximations of the definitions, which lead to efficient DRAT proofs, leveraging the large investment the SAT community has made in DRAT. In experiments on practical SMMT problems, our proof generation overhead is minimal (7.41% geometric mean slowdown, 28.8% worst-case), and we can generate and check proofs for many problems that were previously intractable. |
| title | DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2401.10703 |