Cargando…
Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems
MaxSAT is a very popular language for discrete optimization with many domains of application. While there has been a lot of progress in MaxSAT solvers during the last decade, the theoretical analysis of MaxSAT inference has not followed the pace. Aiming at compensating that lack of balance, in this...
Autores principales: | Larrosa, Javier, Rollon, Emma |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326545/ http://dx.doi.org/10.1007/978-3-030-51825-7_16 |
Ejemplares similares
-
Modeling and solving staff scheduling with partial weighted maxSAT
por: Demirović, Emir, et al.
Publicado: (2017) -
MaxSAT Resolution and Subcube Sums
por: Filmus, Yuval, et al.
Publicado: (2020) -
Incomplete MaxSAT approaches for combinatorial testing
por: Ansótegui, Carlos, et al.
Publicado: (2022) -
Interpretable decision trees through MaxSAT
por: Alòs, Josep, et al.
Publicado: (2022) -
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT
por: Zhang, Zaijun, et al.
Publicado: (2022)