1. J.R. Bitner and E.M. Reingold, Backtrack programming techniques, Comm. ACM 18 (1975) 651–655.
2. M. Bruynooge, Solving combinatorial search problems by intelligent backtracking, Infor. Process. Lett. 12 (1981).
3. R. Feldman and M.C. Golumbic, Optimization algorithms for scheduling via constraint satisfiability, IBM Israel Technical Report (Jan. 1989), submitted for publication.
4. E.C. Freuder, Synthesizing constraint expressions, Comm. ACM 21 (1978) 958–965.
5. M.C. Golumbic, Knowledge-based techniques in an academic environment,Proc. Int. Conf. on Courseware and Design and Evaluation, Symp. on Artificial Intelligence and Education, Ramat Gan, Israel (April 1986) pp. 355–362.