Weaver, S., Franco, J., Schlipf, J. S. Extending existential quantification in conjunctions of BDDs. Journal on Satisfiability, Boolean Modeling and Computation, Volume 1, 2006, 89-110.
Franco, J., Kouril, M., Schlipf, J. S., Weaver, S., Dransfield, M., Vanfleet, W. M., Function-complete lookahead in support of efficient SAT search heuristics. Journal of Universal Computer Science, Know Center and IICM, Graz University, Austria, 2004,1655-1695.
Franco, J., Kouril, M., Schlipf, J. S., Ward, J., Weaver, S., Dransfield, M., Vanfleet, W. M., SBSAT: a state-based, BDD-based Satisfiability solver. Lecture Notes in Computer Science, 2919, Springer, New York, 2003, 398–410.
Weaver, S. A CNF analogue to strengthening. Morehead Electronic Journal of Applicable Mathematics CS-2002-02, 2002.
