1. Lecture Notes in Artificial Intelligence;R. Barták,2004
2. Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: Proc. AAAI, pp. 37–42 (1988)
3. El-Sakkout, H., Wallace, M.: Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5, 359–388 (2000)
4. Lecture Notes in Computer Science;A.S. Fukunaga,2009
5. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)