A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Validating the result of a Quantified Boolean Formula (QBF) solver
2005
Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05
Despite the increasing use of QBF solvers, current QBF solvers do not provide for any mechanism to verify their results. This paper demonstrates a methodology for independently validating the results of a DLL based QBF solver using the traces generated during the solving process. It also presents a mechanism to extract small unsatisfiable subformulas, called cores, from unsatisfiable QBF instances.
doi:10.1145/1120725.1120821
dblp:conf/aspdac/YuM05
fatcat:s5fi3dqgmfgyzmhm6w6vggtram