1. Benedetti M (2004) Evaluating QBFs via symbolic skolemization. In: Proc int’l conf on logic for programming, artificial intelligence and reasoning (LPAR)
2. Benedetti M (2005) Extracting certificates from quantified Boolean formulas. In: Proc int’l joint conf on artificial intelligence (IJCAI)
3. Bloem R, Galler S, Jobstmann B, Piterman N, Pnueli A, Weiglhofer M (2007) Automatic hardware synthesis from specifications: a case study. In: Proc. design automation and test in Europe (DATE)
4. Balabanov V, Jiang J-HR (2011) Resolution proofs and Skolem functions in QBF evaluation and applications. In: Proc int’l conf on computer aided verification (CAV), pp 149–164
5. Berkeley Logic Synthesis and Verification Group. ABC: a system for sequential synthesis and verification. http://www.eecs.berkeley.edu/~alanmi/abc/