Cargando…
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
Two major considerations when encoding pseudo-Boolean (PB) constraints into SAT are the size of the encoding and its propagation strength, that is, the guarantee that it has a good behaviour under unit propagation. Several encodings with propagation strength guarantees rely upon prior compilation of...
Autor principal: | de Colnet, Alexis |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326562/ http://dx.doi.org/10.1007/978-3-030-51825-7_22 |
Ejemplares similares
-
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks
por: Karpiński, Michał, et al.
Publicado: (2020) -
Pseudo-boolean programming and applications
por: Ivanescu, Petru L.
Publicado: (1965) -
Analysis and Practical Guideline of Constraint-Based Boolean Method in Genetic Network Inference
por: Saithong, Treenut, et al.
Publicado: (2012) -
Implicit modeling of narrow vein type ore bodies based on Boolean combination constraints
por: Zhong, Deyun, et al.
Publicado: (2022) -
Boolean reasoning : the logic of Boolean equations
por: Brown, Frank Markham, 1930-
Publicado: (1990)