{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:06:25Z","timestamp":1762916785408,"version":"3.40.5"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence Review"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1023\/a:1011096320004","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T08:38:49Z","timestamp":1040632729000},"page":"269-293","source":"Crossref","is-referenced-by-count":13,"title":["Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches"],"prefix":"10.1007","volume":"15","author":[{"given":"I.","family":"Miguel","sequence":"first","affiliation":[]},{"given":"Q.","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"252815_CR1","unstructured":"Bailluex, O. & Chabrier, J. (1996). Approximate Resolution of Hard Numbering Problems. Proceedings of The 13th National Conference on Artificial Intelligence, 169-174. Portland, Oregon."},{"key":"252815_CR2","unstructured":"Bessiere, C., Freuder, E.C. & Regin, J. (1995). Using Inference to Reduce Arc Consistency Computation. Proceedings of The 14th International Joint Conference on Artificial Intelligence, 592-598. Montreal, Quebec, Canada."},{"key":"252815_CR3","doi-asserted-by":"crossref","unstructured":"Bitner, R. & Reingold, M. (1975). Backtrack Programming Techniques. Communications of the ACM\n18(11).","DOI":"10.1145\/361219.361224"},{"key":"252815_CR4","unstructured":"Cheeseman, P., Kanefsky, B. & Taylor, W.M. (1991). Where the Really Hard Problems Are. Proceedings of The 12th International Joint Conference on Artificial Intelligence, 331-337. Darling Harbour, Sydney, Australia."},{"key":"252815_CR5","unstructured":"David, P. (1993). When Functional and Bijective Constraints Make a CSP Polynomial. Proceedings of The 13th International Joint Conference on Artificial Intelligence, 224-229. Chamberg, France."},{"key":"252815_CR6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","volume":"41","author":"R. Dechter","year":"1990","unstructured":"Dechter, R. (1990). Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition. Artificial Intelligence\n41: 273-312.","journal-title":"Artificial Intelligence"},{"key":"252815_CR7","unstructured":"Dechter, R., Dechter, A. & Pearl, J. (1990). Optimization in Constraint Networks. In Oliver, R.M. & Smith, J.Q. (eds.) Influence Diagrams, Belief Nets and Decision Analysis, 411-425. John Wiley and Sons."},{"key":"252815_CR8","unstructured":"Dechter, R. & Meiri, I. (1989). Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. Proceedings of The 11th International Joint Conference on Artificial Intelligence, 271-277. Detroit, Michigan, USA."},{"key":"252815_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1988","unstructured":"Dechter, R. & Pearl, J. (1988). Network-Based Heuristics for Constraint-Satisfaction Problems. Artificial Intelligence\n34: 1-38.","journal-title":"Artificial Intelligence"},{"key":"252815_CR10","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R. & Pearl, J. (1989). Tree Clustering for Constraint Networks. Artificial Intelligence\n38: 353-366.","journal-title":"Artificial Intelligence"},{"key":"252815_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0004-3702(85)90053-0","volume":"27","author":"Y. Descotte","year":"1985","unstructured":"Descotte, Y. & Latombe, J. (1985). Making Compromises among Antagonist Constraints in a Planner. Artificial Intelligence\n27: 183-217.","journal-title":"Artificial Intelligence"},{"key":"252815_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00132735","volume":"6","author":"D. Dubois","year":"1996","unstructured":"Dubois, D., Fargier, H. & Prade, H. (1996). Possibility Theory in Constraint Satisfaction Problems: Handling Priority, Preference and Uncertainty. Applied Intelligence\n6: 287-309.","journal-title":"Applied Intelligence"},{"key":"252815_CR13","unstructured":"Even, S. (1979). Graph Algorithms. Computer Science Press."},{"key":"252815_CR14","doi-asserted-by":"crossref","unstructured":"Fargier, H. & Lang, J. (1993). Uncertainty in Constraint Satisfaction Problems. Proceedings of ECSQARU' 93, Lecture Notes in Computer Science 747, Springer, 97-104.","DOI":"10.1007\/BFb0028188"},{"key":"252815_CR15","unstructured":"Fox, M.S. (1987). Constraint-Directed Search: A Case Study of Job-Shop Scheduling. Pitman, Morgan Kaufmann."},{"issue":"1","key":"252815_CR16","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E.C. Freuder","year":"1982","unstructured":"Freuder, E.C. (1982). A Sufficient Condition for Backtrack-Free Search. Journal of the ACM\n29(1): 24-32.","journal-title":"Journal of the ACM"},{"key":"252815_CR17","unstructured":"Freuder, E.C. (1989). Partial Constraint Satisfaction. Proceedings of The 11th International Joint Conference on Artificial Intelligence, 278-283. Detroit, Michigan, USA."},{"key":"252815_CR18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E.C. Freuder","year":"1992","unstructured":"Freuder, E.C. & Wallace, R.J. (1992). Partial Constraint Satisfaction. Artificial Intelligence\n58: 21-70.","journal-title":"Artificial Intelligence"},{"key":"252815_CR19","unstructured":"Frost, D. & Dechter, R. (1994). In Search of the Best Constraint Satisfaction Search. Proceedings of The 12th National Conference on Artificial Intelligence, 301-306."},{"key":"252815_CR20","unstructured":"Frost, D. & Dechter, R. (1995). Look-ahead Value Ordering for Constraint Satisfaction. Proceedings of The 14th International Joint Conference on Artificial Intelligence, 572-578. Montreal, Quebec, Canada."},{"key":"252815_CR21","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M. & Elliot, G.L. (1980). Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence\n14: 263-313.","journal-title":"Artificial Intelligence"},{"key":"252815_CR22","unstructured":"Kondrak, G. & van Beek, P. (1995). A Theoretical Evaluation of Selected Backtracking Algorithms. Proceedings of The 14th International Joint Conference on Artificial Intelligence, 541-547. Montreal, Quebec, Canada."},{"key":"252815_CR23","unstructured":"Kumar, V. (1992). Algorithms for Constraint Satisfaction Problems: A Survey. AI Magazine: 32-44."},{"key":"252815_CR24","doi-asserted-by":"crossref","unstructured":"Lang, J. (1991). Possibilistic Logic as a Logical Framework for Min-max Discrete Optimisation Problems and Prioritised Constraints. Proceedings of The International Conference on the Fundamentals of Artificial Intelligence Research, 112-126.","DOI":"10.1007\/3-540-54507-7_10"},{"issue":"1","key":"252815_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/AIC-1989-2101","volume":"2","author":"P. Meseguer","year":"1989","unstructured":"Meseguer, P. (1989). Constraint Satisfaction Problems: An Overview. AI Communications\n2(1): 3-17.","journal-title":"AI Communications"},{"key":"252815_CR26","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1017352218028","volume":"15","author":"I. Miguel","year":"2001","unstructured":"Miguel, I. & Shen, Q. (2001). Solution Techniques for Constraint Satisfaction Problems: Foundations. Artificial Intelligence Review\n15: 241-265.","journal-title":"Artificial Intelligence Review"},{"key":"252815_CR27","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1111\/j.1467-8640.1989.tb00328.x","volume":"5","author":"B.A. Nadel","year":"1989","unstructured":"Nadel, B.A. (1989). Constraint Satisfaction Algorithms. Computational Intelligence\n5: 188-224.","journal-title":"Computational Intelligence"},{"key":"252815_CR28","doi-asserted-by":"crossref","unstructured":"Prosser, P. (1993). Hybrid Algorithms for the Constraint Satisfaction Problem, Computational Intelligence\n9(1).","DOI":"10.1111\/j.1467-8640.1993.tb00310.x"},{"key":"252815_CR29","unstructured":"Prosser, P. (1994). Binary Constraint Satisfaction Problems: Some are Harder than Others. Proceedings of The 11th European Conference on Artificial Intelligence."},{"key":"252815_CR30","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0004-3702(83)80007-1","volume":"21","author":"P.W. Purdom","year":"1983","unstructured":"Purdom, P.W. (1983). Search Rearrangement Backtracking and Polynomial Average Time, Artificial Intelligence\n21: 117-133.","journal-title":"Artificial Intelligence"},{"key":"252815_CR31","doi-asserted-by":"crossref","unstructured":"Sabin, D. & Freuder, E.C. (1994). Contradicting Conventional Wisdom in Constraint Satisfaction. Proceedings of The 11th European Conference on Artificial Intelligence, 125-129.","DOI":"10.1007\/3-540-58601-6_86"},{"key":"252815_CR32","doi-asserted-by":"crossref","unstructured":"Schiex, T. (1992). Possibilistic Constraint Satisfaction Problems, or How to Handle Soft Constraints. Proceedings of The 8th Conference on Uncertainty in Artificial Intelligence, 268-275.","DOI":"10.1016\/B978-1-4832-8287-9.50041-4"},{"key":"252815_CR33","unstructured":"Schiex, T., Fargier, H. & Verfaillie, G. (1995). Valued Constraint Satisfaction Problems: Hard and Easy Problems. Proceedings of The 14th International Joint Conference on Artificial Intelligence, 631-637. Montreal, Quebec, Canada."},{"key":"252815_CR34","unstructured":"Seidel, R. (1981). A New Method for Solving Constraint Satisfaction Problems. Proceedings of The 7th International Joint Conference on Artificial Intelligence, 338-342."},{"issue":"5","key":"252815_CR35","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","volume":"3","author":"L. Shapiro","year":"1981","unstructured":"Shapiro, L. & Haralick, R. (1981). Structural Descriptions and Inexact Matching, IEEE Transactions on Pattern Analysis and Machine Intelligence\n3(5): 504-518.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"252815_CR36","volume-title":"Technical Report RC 12057","author":"H.S. Stone","year":"1986","unstructured":"Stone, H.S. & Stone, J. (1986). Efficient Search Techniques: An Empirical Study of the N-Queens Problem. Technical Report RC 12057. IBM T.J. Watson Research Centeer, Yorktown Heights, New York."},{"issue":"3","key":"252815_CR37","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E. & Yannakakis, M. (1984). Simple Linear-time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM Journal of Computing\n13(3): 566-579.","journal-title":"SIAM Journal of Computing"},{"key":"252815_CR38","unstructured":"Wallace, R.J. (1996). Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem. Proceedings of The 13th National Conference on Arti-ficial Intelligence, 188-195. Portland, Oregon."}],"container-title":["Artificial Intelligence Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011096320004.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011096320004\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011096320004.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T04:36:50Z","timestamp":1747543010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011096320004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["252815"],"URL":"https:\/\/doi.org\/10.1023\/a:1011096320004","relation":{},"ISSN":["0269-2821","1573-7462"],"issn-type":[{"type":"print","value":"0269-2821"},{"type":"electronic","value":"1573-7462"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}