@inbook {IOPORT.05930521,
    author       = {Brauer, J\"org and King, Andy},
    title        = {Approximate quantifier elimination for propositional Boolean formulae.},
    year         = {2011},
    booktitle    = {NASA formal methods. Third international symposium, NFM 2011, Pasadena, CA, USA, April 18--20, 2011. Proceedings},
    isbn         = {978-3-642-20397-8},
    pages        = {73-88},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-642-20398-5_7},
    abstract     = {Summary: This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula. This construction naturally leads to an anytime algorithm, that is, it can be interrupted at anytime without compromising soundness. This contrasts with classical monolithic (all or nothing) approaches based on resolution or model enumeration.},
    identifier   = {05930521},
}