Resolve and Expand
By Armin Biere. International Conference on Theory and Applications of Satisfiability Testing, 2004
296 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/93d81f20080019820b0b8179bb5de45b1e99a095
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
- Armando Solar-Lezama
- Vijay Ganesh
- Roland Memisevic
- Horst Samulowitz
- Rastislav Bodík
- Pieter Hooimeijer
- Adam Kiezun
- Philip J. Guo
In Computational Theory and Mathematics
- Armando Solar-Lezama
- Adam Kiezun
- Michael D. Ernst
- Philip J. Guo
- Pieter Hooimeijer
- Vijay Ganesh
- Roland Memisevic
- Horst Samulowitz
Citations in the corpus
- Program synthesis by sketching (2008, background): “0, the winner of the 2008 competition [11].”
- HAMPI: a solver for string constraints (2009, methodology): “For the first disjunct ()[()() + (())], Hampi creates the following formula: D1a: bv[0] = 40 ∧ bv[1] = 41 ∧ ((bv[2] = 40 ∧ bv[3] = 41 ∧ bv[4] = 40 ∧ bv[5] = 41) ∨ (bv[2] = 40 ∧ bv[3] = 40 ∧ bv[4] = 41 ∧ bv[5] = 41)).”
- Program sketching (2012, background): “0, the winner of the 2008 competition [4].”
- Learning to Solve QBF (2007, methodology): “The winning search-based solver used Quantor (a solver based on variable elimination (Biere 2004)) as a time-limited pre-processor.”