This package contains the source code for Quaffle, an experimental 
Quantified Boolean Formula (QBF) satisfiability solver. The 
algorithms used in this solver are described in [1] and [2].  
Some sample inputs and description of the input file format 
are described in [3]. You can also choose to use the format 
described in [4] by comment out the following line in config.h

#define INPUT_FORMAT_RINTANEN

You can choose to use either nave backtracking scheme or learning 
and non-chronological backtracking scheme by modifying config.h

The code released is for evaluation of algorithms purpose only, 
therefore, it has quite a few loose ends and the implementation 
may not be optimized. For any questions and bug reports, please 
send email to lintaoz@ee.princeton.edu

The code is tested under Linux with g++ 2.9x and 3.0x. It 
should have little problem compile under most Unix systems using
g++.

Lintao Zhang
Department of Electrical Engineering
Princeton University
2003.3.4


REFERENCES:

[1] L. Zhang and S. Malik, "Towards Symmetric Treatment of 
Conflicts And Satisfaction in Quantified Boolean Satisfiability 
Solver", Proceedings of 8th International Conference on 
Principles and Practice of Constraint Programming (CP2002). 
Ithaca, NY, Sept. 2002.

[2] L. Zhang and S. Malik, "Conflict Driven Learning in a 
Quantified Boolean Satisfiability Solver", Proceedings of 
International Conference on Computer Aided Design (ICCAD2002), 
San Jose, CA, Nov. 2002.

[3] http://www.informatik.uni-freiburg.de/~rintanen/qbf.html

[4] http://www.mrg.dist.unige.it/~qube/qbflib/benchm.html
