Iterative and core-guided MaxSAT solving: A survey and assessment
By António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, Joao Marques-Silva. 2013
193 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Industrial and Manufacturing Engineering
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- J. Berg
- Matti Järvisalo
- Paul Saikko
- Fahiem Bacchus
- Inês Lynce
- Nina Narodytska
- Vasco M. Manquinho
- Ruben Martins
In Computer Networks and Communications
- J. Berg
- Matti Järvisalo
- Paul Saikko
- Fahiem Bacchus
- Inês Lynce
- Nina Narodytska
- Vasco M. Manquinho
- Ruben Martins
In Industrial and Manufacturing Engineering
Citations in the corpus
- Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search (2019, unknown): “See [3, 20] for more details.”
- Open-WBO: A Modular MaxSAT Solver, (2014, background): “In what follows we assume that the reader is familiar with MaxSAT [21,26].”
- Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT (2015, methodology): “In this work, we focus on the Maximum satisfiability (MaxSAT) problem [Li and Manyà, 2009; Morgado et al., 2013; Ansótegui et al., 2013], a well-known optimization variant of SAT.”
- Maximum Satisfiability Using Core-Guided MaxSAT Resolution (2014, background): “The most successful approachs to solving larger industrial problems has been core-guided approaches (Morgado et al. 2013) where a sequence of unsatisfiable cores are extracted using a S AT solver.”