1. Lecture Notes in Artificial Intelligence;G. Audemard,2002
2. Lecture Notes in Computer Science;A. Armando,2000
3. Armando, A., Castellini, C., Giunchiglia, E., Idini, M., Maratea, M.: TSAT++: an open platform for satisfiability modulo theories. In: Proceedings of PDPAR 2004 - Pragmatics of Decision Procedures in Automated Reasoning, Cork, Ireland. Elsevier Science Publishers, Amsterdam (2004) (to appear)
4. Bayardo Jr., R.J., Miranker, D.P.: A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In: Proc. AAAI, pp. 298–304 (1996)
5. Bayardo Jr., R.J., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI 1997/IAAI 1997), July 27–31, pp. 203–208. AAAI Press, Menlo Park (1997)