QBFLIB - The Quantified Boolean Formulas Satisfiability Library

created by M. Narizzano
maintained by M. Narizzano and A. Tacchella.


  News   History   Acknowledgements

Overview:


Introduction

QBFLIB is a collection of benchmark problems, solvers, and tools related to Quantified Boolean Formula (QBF) satisfiability. QBFLIB is meant as a service to the QBF research community and its main goal is to provide an uniform test-bed for the empirical characterization of QBF solvers.

The QBFLIB benchmark suite is currently comprised of more than 4000 instances.

The QBFLIB solvers collection lists the web sites of all the QBF solvers we are currently aware of.

The QBF Annotated Bibliography contains pointers to papers on QBF solvers, algorithms, and applications as well as closely related areas. This section is still incomplete and we appreciate to get references to papers you would like to see included in this list.

Finally, QBFLIB maintains lists of links to related sites, of people involved in QBF research, and QBF-related events.

Please help us to keep QBFLIB updated by submitting new benchmark problems, solvers, and tools. Consult the submission guidelines and/or contact us by email. if you want to learn more about the submission process. Your collaboration is essential to improve QBFLIB, so do not hesitate to send us feedback, comments, and suggestions.


DISCLAIMER OF WARRANTY. The software hosted on this page is research work provided by various people (as indicated above). The software is provided "as is" without warranty of any kind and without any support services
© MRG-DIST, last update 18 - Jun - 02.