本章参考文献
[1] Philippe Jégou,Terrioux C.Hybrid backtracking bounded by tree-decomposition of constraint networks[J].Artificial Intelligence,2003,146(1):43-75.
[2] Chang L,Qin F,Li A.A novel backtracking scheme for attitude determinationbased initial alignment[J].IEEE Transactions on Automation Science and Engineering,2015,12(1):384-390.
[3] Frost D,Dechter R.Look-ahead value ordering for constraint satisfaction problems[C]//IJCAI(1),1995:572-578.
[4] Xing Y,Gong Y Z,Wang Y W,et al.Path-wise test data generation based on heuristic look-ahead methods[J].Mathematical Problems in Engineering,2014.http://dx.doi.org/10.1155/2014/642630
[5] Dechter Rina,MeiriItay,PearlJudea.Temporal constraint networks[J].Artificial Intelligence,1991,49(1-3):61-95.
[6] Bitner J R,Reingold E M.Backtrack programming techniques[J].Communications of the Acm,1975,18(11):651-656.
[7] Prosser P.Hybrid algorithms for the constraint satisfaction problem[J].Computational intelligence,1993,9(3):268-299.
[8] Hermadi I,Lokan C,Sarker R.Dynamic stopping criteria for search-based test data generation for path testing[J].Butterworth-Heinemann,2014,56(4):395-407.
[9] Shapiro S C.Encyclopedia of artificial intelligence,vols.1 and 2[M].New York:Information Science Reference,1987.
[10] Gaschig J.Performance measurement and analysis of certain search algorithms[D].Pittsburgh:Carnegie-Mellon University,1979.
[11] Fikes R E.REF-ARF:a system for solving problems stated as procedures[J].Artificial Intelligence,1970,1(1-2):27-120.(https://www.daowen.com)
[12] Waltz D L.Generating semantic descriptions from drawings of scenes with shadows[R].Massachusetts Institute of Technology,1972:19-91.
[13] Waltz D.Understanding line drawings of scenes with shadows[M].New York:McGraw-Hill Book Company,1975.
[14] Mackworth A K.Consistency in networks of relations artificial intelligence[J].Artificial Intelligence,1977,8(1):99-118.
[15] Erratum.The complexity of some polynomial network consistency algorithms for constraint satisfaction problems:A.K.Mackworth and E.C.Freuder[J].Artificial Intelligence,1985,26(2):247.
[16] Mohr R,Henderson T C.Arc and path consistence revisited[J].Artificial Intelligence,1986,28(2):225-233.
[17] Van Hentenryck P,Deville Y,Teng C M.A generic arc-consistency algorithm and its specializations[J].Artificial intelligence,1992,57(2-3):291-321.
[18] Perlin M.Arc consistency for factorable relations[J].Artificial Intelligence,1992,53(2-3):329-342.
[19] Bessiere C.Arc-consistency and arc-consistency again[J].Artificial intelligence,1994,65(1):179-190.
[20] Zhao R,Harman M,Li Z.Empirical study on the efficiency of search based test generation for EFSM models[C]//Third International Conference on Software Testing,Verification,and Validation Workshops.IEEE,2010:222-231.
[21] Fitch F B,McCulloch Warren S,Pitts Walter.A logical calculus of the ideas immanent in nervous activity[J].Journal of Symbolic Logic,1944,9(2):49-50.
