Cargando…
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks
Incremental techniques have been widely used in solving problems reducible to SAT and MaxSAT instances. When an algorithm requires making subsequent runs of a SAT-solver on a slightly changing input formula, it is usually beneficial to change the strategy, so that the algorithm only operates on a si...
Autores principales: | Karpiński, Michał, Piotrów, Marek |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326544/ http://dx.doi.org/10.1007/978-3-030-51825-7_36 |
Ejemplares similares
-
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
por: de Colnet, Alexis
Publicado: (2020) -
Pseudo-boolean programming and applications
por: Ivanescu, Petru L.
Publicado: (1965) -
The Dynamics of Canalizing Boolean Networks
por: Paul, Elijah, et al.
Publicado: (2020) -
Influence maximization in Boolean networks
por: Parmer, Thomas, et al.
Publicado: (2022) -
Boolean Networks as Modeling Framework
por: Greil, Florian
Publicado: (2012)