Talks and Poster Presentations (with Proceedings-Entry):

F. Lonsing, U. Egly:
"Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API";
Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT), Austin, Texas, USA; 2015-09-24 - 2015-09-27; in: "Lecture Notes in Computer Science", Springer, 9340 (2015), 191 - 198.

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Related Projects:
Project Head Uwe Egly:
Quantified Boolean Formulas

Created from the Publication Database of the Vienna University of Technology.