Cargando…
Sorting Parity Encodings by Reusing Variables
Parity reasoning is challenging for CDCL solvers: Refuting a formula consisting of two contradictory, differently ordered parity constraints of modest size is hard. Two alternative methods can solve these reordered parity formulas efficiently: binary decision diagrams and Gaussian Elimination (which...
Autores principales: | Chew, Leroy, Heule, Marijn J. H. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326471/ http://dx.doi.org/10.1007/978-3-030-51825-7_1 |
Ejemplares similares
-
A degradation-based sorting method for lithium-ion battery reuse
por: Chen, Hao, et al.
Publicado: (2017) -
Generating Extended Resolution Proofs with a BDD-Based SAT Solver
por: Bryant, Randal E., et al.
Publicado: (2021) -
Flexible reuse of cortico-hippocampal representations during encoding and recall of naturalistic events
por: Reagh, Zachariah M., et al.
Publicado: (2023) -
Mycielski Graphs and [Formula: see text] Proofs
por: Yolcu, Emre, et al.
Publicado: (2020) -
Strong Extension-Free Proof Systems
por: Heule, Marijn J. H., et al.
Publicado: (2019)