Cargando…
A Flexible Proof Format for SAT Solver-Elaborator Communication
We introduce FRAT, a new proof format for unsatisfiable SAT problems, and its associated toolchain. Compared to DRAT, the FRAT format allows solvers to include more information in proofs to reduce the computational cost of subsequent elaboration to LRAT. The format is easy to parse forward and backw...
Autores principales: | Baek, Seulkee, Carneiro, Mario, Heule, Marijn J. H. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7979213/ http://dx.doi.org/10.1007/978-3-030-72016-2_4 |
Ejemplares similares
-
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
por: Bryant, Randal E., et al.
Publicado: (2021) -
On speeding up factoring with quantum SAT solvers
por: Mosca, Michele, et al.
Publicado: (2020) -
Factoring semi-primes with (quantum) SAT-solvers
por: Mosca, Michele, et al.
Publicado: (2022) -
Strong Extension-Free Proof Systems
por: Heule, Marijn J. H., et al.
Publicado: (2019) -
Mycielski Graphs and [Formula: see text] Proofs
por: Yolcu, Emre, et al.
Publicado: (2020)