Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
By Gilles Audemard, Jean-Marie Lagniez, Laurent Simon. 2013
142 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Peter James Stuckey
- Jinqiang Yu
- Pierre Le Bodic
- Alexey Ignatiev
- Inês Lynce
- Vasco M. Manquinho
- Ruben Martins
- Joao Marques-Silva
In Computational Theory and Mathematics
- Peter James Stuckey
- Jinqiang Yu
- Pierre Le Bodic
- Alexey Ignatiev
- Inês Lynce
- Vasco M. Manquinho
- Ruben Martins
- Kuldeep S. Meel
Citations in the corpus
- Optimal Decision Lists using SAT (2020, background): “The underlying SAT solver is Glucose 3 (Audemard, Lagniez, and Simon 2013).”
- Computing Optimal Decision Sets with SAT (2020, methodology): “ompetitors. Based on the publicly available implementation of MinDS [31,51], all the proposed models were implemented in a prototype as a Python script instrumenting calls to the Glucose 3 SAT solver [2,27]. The implementation targets the models proposed in the paper, namely, (1) the iterative SAT m”
- RC2: an Efficient MaxSAT Solver (2019, methodology): “By default, RC2 uses Glucose 3.0 [5] as the underlying SAT oracle.”
- Open-WBO: A Modular MaxSAT Solver, (2014, methodology): “0 was modified to support the optimizations on assumptions [7] for MaxSAT.”