{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:02Z","timestamp":1752379802430,"version":"3.41.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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":["Constraints"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1023\/a:1015161716072","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T17:32:56Z","timestamp":1041096776000},"page":"199-219","source":"Crossref","is-referenced-by-count":4,"title":["Fourier Elimination for Compiling Constraint Hierarchies"],"prefix":"10.1007","volume":"7","author":[{"given":"Warwick","family":"Harvey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Borning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"399081_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/357146.357147","volume":"3","author":"A. Borning","year":"1981","unstructured":"Borning, A. (1981). The programming language aspects of ThingLab, a constraint-oriented simulation laboratory. ACM Transactions on Programming Languages and Systems, 3(4): 353\u2013387.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"399081_CR2","doi-asserted-by":"crossref","unstructured":"Borning, A., Anderson, R., & Freeman-Benson, B. (1996). Indigo: A local propagation algorithm for inequality constraints. In Proceedings of the 1996 ACM Symposium on User Interface Software and Technology, pages 129\u2013136. Seattle.","DOI":"10.1145\/237091.237110"},{"key":"399081_CR3","doi-asserted-by":"crossref","unstructured":"Borning, A., & Freeman-Benson, B. (1995). The OTI constraint solver: A constraint library for constructing interactive graphical user interfaces. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming, pages 624\u2013628. Cassis, France.","DOI":"10.1007\/3-540-60299-2_38"},{"issue":"1","key":"399081_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1009704614502","volume":"3","author":"A. Borning","year":"1998","unstructured":"Borning, A., & Freeman-Benson, B. (1998). Ultraviolet: A constraint satisfaction algorithm for interactive graphics. Constraints: An International Journal, 3(1): 9\u201332.","journal-title":"Constraints: An International Journal"},{"issue":"3","key":"399081_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01807506","volume":"5","author":"A. Borning","year":"1992","unstructured":"Borning, A., Freeman-Benson, B., & Wilson, M. (1992). Constraint hierarchies. Lisp and Symbolic Computation, 5(3): 223\u2013270.","journal-title":"Lisp and Symbolic Computation"},{"key":"399081_CR6","doi-asserted-by":"crossref","unstructured":"Borning, A., Lin, R., & Marriott, K. (1997). Constraints for the web. In Proceedings of Fifth ACM International Multi-Media Conference, pages 173\u2013182.","DOI":"10.1145\/266180.266361"},{"key":"399081_CR7","doi-asserted-by":"crossref","unstructured":"Borning, A., Marriott, K., Stuckey, P., & Xiao, Y. (1997). Solving linear arithmetic constraints for user interface applications. In Proceedings of the 1997 ACM Symposium on User Interface Software and Technology, pages 87\u201396.","DOI":"10.1145\/263407.263518"},{"key":"399081_CR8","unstructured":"Freeman-Benson, B. Object Technology International, Personal communication."},{"key":"399081_CR9","doi-asserted-by":"crossref","unstructured":"Greene, D. H., & Yao, F. F. (1986). Finite-resolution computational geometry. In Proceedings of the 27th Annual Symposium on the Foundations of Computer Science, pages 143\u2013152. IEEE Computer Society Press.","DOI":"10.1109\/SFCS.1986.19"},{"key":"399081_CR10","doi-asserted-by":"crossref","unstructured":"Harvey, W., Stuckey, P. J., & Borning, A. (1997). Compiling constraint solving using projection. In G. Smolka (ed.), Proceedings of the Third International Conference on Principles and Practices of Constraint Programming, LNCS, pages 491\u2013505. Springer-Verlag.","DOI":"10.1007\/BFb0017462"},{"key":"399081_CR11","first-page":"86","volume-title":"Proceedings of the International Workshop on Principle and Practices of Constraint Programming","author":"J. Jaffar","year":"1994","unstructured":"Jaffar, J., Maher, M. J., Stuckey, P. J., & Yao, R. H. C. (1994). Beyond finite domains. In Proceedings of the International Workshop on Principle and Practices of Constraint Programming, number 874 in LNCS, pages 86\u201393. Orcas Island, Washington, Springer-Verlag."},{"key":"399081_CR12","unstructured":"Nelson, C.G. (1978). An nlog n algorithm for the two-variable-per-constraint linear programming satisfiability problem. Technical Report STAN-CS-78-689. Stanford University."},{"key":"399081_CR13","doi-asserted-by":"crossref","unstructured":"Sabin, D., & Freuder, E. C. (1997). Understanding and improving the MAC algorithm. In G. Smolka (ed.), Proceedings of the Third International Conference on Principles and Practices of Constraint Programming, LNCS, pages 167\u2013181. Springer-Verlag.","DOI":"10.1007\/BFb0017438"},{"issue":"1\u20133","key":"399081_CR14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Somogyi, Z., Henderson, F., & Conway, T. (1996). The execution algorithm of Mercury: An efficient purely declarative logic programming language. Journal of Logic Programming, 29(1\u20133): 17\u201364.","journal-title":"Journal of Logic Programming"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015161716072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015161716072\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015161716072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:51:53Z","timestamp":1752378713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015161716072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["399081"],"URL":"https:\/\/doi.org\/10.1023\/a:1015161716072","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}