Florian Lonsing, Uwe Egly. Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API. In Marijn Heule, Sean Weaver, editors, Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings. Volume 9340 of Lecture Notes in Computer Science, pages 191-198, Springer, 2015. [doi]
@inproceedings{LonsingE15, title = {Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API}, author = {Florian Lonsing and Uwe Egly}, year = {2015}, doi = {10.1007/978-3-319-24318-4_14}, url = {http://dx.doi.org/10.1007/978-3-319-24318-4_14}, researchr = {https://researchr.org/publication/LonsingE15}, cites = {0}, citedby = {0}, pages = {191-198}, booktitle = {Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings}, editor = {Marijn Heule and Sean Weaver}, volume = {9340}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-319-24317-7}, }