{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:20:22Z","timestamp":1648815622478},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1007\/bf03038310","type":"journal-article","created":{"date-parts":[[2009,4,27]],"date-time":"2009-04-27T04:03:39Z","timestamp":1240805019000},"page":"99-115","source":"Crossref","is-referenced-by-count":5,"title":["A quantitative solution to Constraint Satisfaction Problem (CSP)"],"prefix":"10.1007","volume":"13","author":[{"given":"Jun","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"BF03038310_CR1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/361219.361224","volume":"18","author":"J. R. Bitner","year":"1975","unstructured":"Bitner, J. R. and Reingold, E. M., \u201cBacktrack Programming Techniques,\u201dComm. of ACM, 18, 11, pp. 651\u2013656, Nov. 1975.","journal-title":"Comm. of ACM"},{"key":"BF03038310_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S. A., \u201cThe Complexity of Theorem-Proving Procedures,\u201d inProceedings of the Third ACM Symposium on Theory of Computing, pp. 151\u2013158, 1971.","DOI":"10.1145\/800157.805047"},{"key":"BF03038310_CR3","doi-asserted-by":"crossref","unstructured":"Davis, M. and Putnam, H., \u201cA Computing Procedure for Quantification Theory,\u201dJ. of ACM, pp. 201\u2013215, 1960.","DOI":"10.1145\/321033.321034"},{"key":"BF03038310_CR4","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. and Pearl, J., \u201cNetwork-Based Heuristics for Constraint-Satisfaction Problems,\u201dArtificial Intelligence, 34, pp. 1\u201338, 1988.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"BF03038310_CR5","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E. C. Freuder","year":"1982","unstructured":"Freuder, E. C., \u201cA Sufficient Condition for Backtrack-Free Search,\u201dJ. ACM, 29, 1, pp. 24\u201332, Jan. 1982.","journal-title":"J. ACM"},{"issue":"4","key":"BF03038310_CR6","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E. C. Freuder","year":"1985","unstructured":"Freuder, E. C., \u201cA Sufficient Condition for Backtrack-Bounded Search,\u201dJ. ACM, 32, 4, pp. 755\u2013761, Oct. 1985.","journal-title":"J. ACM"},{"key":"BF03038310_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S.,Computers and Intractability: A Guide to the Theory of NP Completeness, W. H. Freeman and Company, San Francisco, 1979."},{"key":"BF03038310_CR8","unstructured":"Gaschnig, J., \u201cPerformance Measurements and Analysis of Certain Search Algorithms,\u201dPh. D thesis, Carnegie-Mellon University, Department of Computer Science, May 1979."},{"key":"BF03038310_CR9","unstructured":"Gu, J., \u201cHow to Solve Very Large-Scale Satisfiability (VLSS) Problems,\u201dTechnical Report, 1988. (Present in part in, Gu, J., \u201cBenchmarking SAT Algorithms,\u201dTechnical Report, UCECE-TR-90-002, 1990)."},{"issue":"8","key":"BF03038310_CR10","first-page":"865","volume":"14","author":"J. Gu","year":"1992","unstructured":"Gu, J., \u201cThe UniSAT Problem Models (Appendix),\u201dIEEE Trans. on Pattern Analysis and Machine Intelligence, 14, 8, p. 865, Aug. 1992.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"BF03038310_CR11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/130836.130837","volume":"3","author":"J. Gu","year":"1992","unstructured":"Gu, J., \u201cEfficient Local Search for Very Large-Scale Satisfiability Problem,\u201dSIGART Bulletin, 3, 1, pp. 8\u201312, ACM Press, Jan. 1992.","journal-title":"SIGART Bulletin"},{"issue":"4","key":"BF03038310_CR12","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/21.247892","volume":"23","author":"J. Gu","year":"1993","unstructured":"Gu, J., \u201cLocal Search for Satisfiability (SAT) Problem,\u201dIEEE Trans. on Systems, Man, and Cybernetics, 23, 4, pp. 1108\u20131129, July\/Aug. 1993.","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"issue":"3","key":"BF03038310_CR13","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/69.334864","volume":"6","author":"J. Gu","year":"1994","unstructured":"Gu, J.,Global Optimization for Satisfiability (SAT) Problem, IEEE Trans. on Knowledge and Data Engineering, 6(3): 361\u2013381, June 1994.","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"BF03038310_CR14","first-page":"63","volume-title":"Advanced Series on Artificial Intelligence Vol. 1","author":"J. Gu","year":"1992","unstructured":"Gu, J., \u201cOn Optimizing a Search Problem,\u201d inAdvanced Series on Artificial Intelligence Vol. 1, chapter 2, World Scientific, New Jersey, pp. 63\u2013105, Jan. 1992."},{"key":"BF03038310_CR15","volume-title":"Constraint-Based Search","author":"J. Gu","year":"1995","unstructured":"Gu, J.Constraint-Based Search, Cambridge University Press, New York, 1995."},{"issue":"8","key":"BF03038310_CR16","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1109\/34.149596","volume":"14","author":"J. Gu","year":"1992","unstructured":"Gu, J. and Wang, W., \u201cA Novel Discrete Relaxation Architecture,\u201dIEEE Trans. on Pattern Analysis and Machine Intelligence, 14, 8, pp. 857\u2013865, Aug. 1992.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"BF03038310_CR17","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1109\/TPAMI.1987.4767988","volume":"6","author":"J. Gu","year":"1987","unstructured":"Gu, J., Wang, W., and Henderson, T. C., \u201cA Parallel Architecture for Discrete Relaxation Algorithm,\u201dIEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-9, 6, pp. 816\u2013831, Nov. 1987.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-9"},{"key":"BF03038310_CR18","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. and Elliot, G., \u201cIncreasing Tree Search Efficiency for Constraint Satisfaction Problems,\u201dArtificial Intelligence, 14, pp. 263\u2013313, 1980.","journal-title":"Artificial Intelligence"},{"key":"BF03038310_CR19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TPAMI.1979.4766903","volume":"2","author":"R. M. Haralick","year":"1979","unstructured":"Haralick, R. M. and Shapiro, L. G., \u201cThe Consistent Labeling Problem: Part 1,\u201dIEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-1, 2, pp. 173\u2013184, Apr. 1979.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-1"},{"key":"BF03038310_CR20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-9236(88)90097-8","volume":"4","author":"J. N. Hooker","year":"1988","unstructured":"Hooker, J. N., \u201cA Quantitative Approach to Logical Inference,\u201dDecision Support Systems, 4, pp. 45\u201369, 1988.","journal-title":"Decision Support Systems"},{"issue":"1","key":"BF03038310_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(88)90044-2","volume":"7","author":"J. N. Hooker","year":"1988","unstructured":"Hooker, J. N., \u201cResolution vs. Cutting Plane Solution of Inference Problems: Some Computational Experience,\u201dOperations Research Letter, 7, 1, pp. 1\u20137, 1988.","journal-title":"Operations Research Letter"},{"key":"BF03038310_CR22","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1978","unstructured":"Horowitz, E. and Sahni, S.,Fundamentals of Computer Algorithms, Computer Science Press, Rockville, 1978."},{"key":"BF03038310_CR23","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-9236(88)90128-5","volume":"4","author":"R. G. Jeroslow","year":"1988","unstructured":"Jeroslow, R. G., \u201cComputation-Oriented Reductions of Predicate to Propositional Logic,\u201dDecision Support Systems, 4, pp. 183\u2013197, 1988.","journal-title":"Decision Support Systems"},{"key":"BF03038310_CR24","unstructured":"Kamath, A. P., Karmarkar, N. K., Ramakrishnan, K. G., and Resende, M. G. C., \u201cComputational Experience with an Interior Point Algorithm on the Satisfiability Problem,\u201dWorking Paper, Mathematical Science Research Center, AT&T Bell Laboratories, Oct. 1989."},{"key":"BF03038310_CR25","unstructured":"Kumar, V., \u201cAlgorithms for Constraint Satisfaction Problems: A Survey,\u201dTechnical Report, TR-91-28, Department of Computer Science, University of Minnesota, 1991."},{"issue":"1","key":"BF03038310_CR26","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V., \u201cAlgorithms for Constraint Satisfaction Problems: A Survey,\u201dThe AI Magazine, 13, 1, pp. 32\u201344, 1992.","journal-title":"The AI Magazine"},{"key":"BF03038310_CR27","volume-title":"Linear and Nonlinear Programming","author":"D. G. Luenberger","year":"1984","unstructured":"Luenberger, D. G.Linear and Nonlinear Programming, Addison-Wesley, Reading, 1984."},{"key":"BF03038310_CR28","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. K. Mackworth","year":"1977","unstructured":"Mackworth, A. K., \u201cConsistency in Networks of Relations,\u201dArtificial Intelligence, 8, pp. 99\u2013119, 1977.","journal-title":"Artificial Intelligence"},{"key":"BF03038310_CR29","doi-asserted-by":"crossref","unstructured":"Martins, J. P. and Shapiro, S. C., \u201cTheoretical Foundations for Belief Revision,\u201d inProceedings Conference on Theoretical Aspects of Reasoning about Knowledge, pp. 383\u2013398, 1986.","DOI":"10.1016\/B978-0-934613-04-0.50031-4"},{"key":"BF03038310_CR30","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R. Mohr","year":"1986","unstructured":"Mohr, R. and Henderson, T. C., \u201cArc and Path Consistency Revisited,\u201dArtificial Intelligence, 28, pp. 225\u2013233, 1986.","journal-title":"Artificial Intelligence"},{"key":"BF03038310_CR31","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"Montanari, U., \u201cNetworks of Constraints: Fundamental Properties and Applications to Picture Processing,\u201dInformation Sciences, 7, pp. 95\u2013132, 1974.","journal-title":"Information Sciences"},{"key":"BF03038310_CR32","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., \u201cConstraint Satisfaction Algorithms,\u201dComputational Intelligence, 5, pp. 188\u2013224, 1989.","journal-title":"Computational Intelligence"},{"key":"BF03038310_CR33","volume-title":"Principles of Artificial Intelligence","author":"N. J. Nilsson","year":"1980","unstructured":"Nilsson, N. J.,Principles of Artificial Intelligence, Tioga Publishing Company, Palo Alto, California, 1980."},{"key":"BF03038310_CR34","volume-title":"Combinatorial Optimization","author":"C. H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H. and Steiglitz, K.,Combinatorial Optimization, Prentice-Hall, Englewood Cliffs, NJ, 1982."},{"issue":"4","key":"BF03038310_CR35","first-page":"449","volume":"13","author":"P. Purdom","year":"1990","unstructured":"Purdom, P., \u201cA Survey of Average Time Analyses of Satisfiability Algorithms,\u201dJ. of Information Processing, 13, 4, pp. 449\u2013455, 1990.","journal-title":"J. of Information Processing"},{"key":"BF03038310_CR36","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., \u201cSearch Rearrangement Backtracking and Polynomial Average Time,\u201dArtificial Intelligence, 21, pp. 117\u2013133, 1983.","journal-title":"Artificial Intelligence"},{"key":"BF03038310_CR37","doi-asserted-by":"crossref","unstructured":"Robinson, J. A., \u201cA Machine-Oriented Logic Based on the Resolution Principle,\u201dJournal of the ACM, pp. 23\u201341, 1965.","DOI":"10.1145\/321250.321253"},{"key":"BF03038310_CR38","first-page":"19","volume-title":"The Psychology of Computer Vision","author":"D. Waltz","year":"1975","unstructured":"Waltz, D., \u201cUnderstanding Line Drawings of Scenes with Shadows,\u201d inThe Psychology of Computer Vision (P. H. Winston), chapter 2, McGraw-Hill Book Company, New York, pp. 19\u201392, 1975."},{"key":"BF03038310_CR39","first-page":"81","volume":"2","author":"H. P. Williams","year":"1987","unstructured":"Williams, H. P., \u201cLinear and Integer Programming Applied to the Propositional Calculus,\u201dSystems Research and Information Sciences, 2, pp. 81\u2013100, 1987.","journal-title":"Systems Research and Information Sciences"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03038310.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03038310\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03038310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:44Z","timestamp":1558572764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03038310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["BF03038310"],"URL":"https:\/\/doi.org\/10.1007\/bf03038310","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}