| collected by | Ian P. Gent ipg@cs.strath.ac.uk | Toby Walsh tw@cs.strath.ac.uk |
An Overview of Backtrack Search Satisfiability Algorithms, João P. Marques-Silva, in Fifth International Symposium on Artificial Intelligence and Mathematics, January 1998.
Implementing Davis-Putnam's method by tries
Zhang, H., Stickel, M., Technical Report, The University of Iowa, 1994.
An efficient algorithm for unit-propagation
Zhang, H., Stickel, M., Proc. of the Fourth International Symposium on Artificial
Intelligence and Mathematics. Ft. Lauderdale, Florida, 1996.
SATO: An Efficient Propositional Prover
H. Zhang,
Proc. of International Conference on Automated Deduction
(CADE-97).
Using CSP look-back
techniques to solve exceptionally hard SAT instances.
R. J. Bayardo Jr. and
R. C. Schrag,
Proc. of the Second Int'l Conf. on Principles
and Practice of Constraint Programming (Lecture Notes in Computer
Science 1118) 46-60, Springer, 1996.
"Conflict Analysis in Search Algorithms for Propositional Satisfiability," João P. Marques-Silva and Karem A. Sakallah, in Proceedings of the IEEE International Conference on Tools with Artificial Intelligence, November 1996.
PSATO: A Distributed Propositional Prover and Its
Application to Quasigroup Problems
.
Hantao Zhang, Maria Paola Bonacina and Jieh Hsiang.
Journal of Symbolic Computation, 11, 1-18, 1996.