References

[GJ79]

Michael R. Garey and David S. Johnson. Computers and Intractability --- A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, 1979.

[Hsi85]

Jieh Hsiang. Refutational theorem proving using term-rewriting systems. Artificial Intelligence, 25(1):255--300, 1985.

[HV95]

J. N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15(3):359--383, 1995.

[Joh92]

Peter T. Johnstone. Notes on Logic and Set Theory. Cambridge University Press, 1992.

[Knu73]

Donald Ervin Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, 1973.

[Min93]

Shin-Ichi Minato. Zero-suppressed BDDs for set manipulation in combinatorial problems. In Proceedings of the 30th ACM/IEEE Design Automation Conference, pages 272--277, Dallas, TX, June 1993. ACM Press.