{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T23:34:17Z","timestamp":1676072057763},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":[[1995,6]]},"DOI":"10.1007\/bf03038312","type":"journal-article","created":{"date-parts":[[2009,4,27]],"date-time":"2009-04-27T00:03:09Z","timestamp":1240790589000},"page":"155-186","source":"Crossref","is-referenced-by-count":2,"title":["Compile-time analysis of nonlinear constraints in CLPR"],"prefix":"10.1007","volume":"13","author":[{"given":"Michael","family":"Hanus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03038312_CR1","unstructured":"Abramsky, S. and Hankin, C., eds.Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987."},{"key":"BF03038312_CR2","doi-asserted-by":"crossref","unstructured":"Aiba, A., Sakai, K., Sato, Y., Hawley, D. J., and Hasegawa, R., \u201cConstraint Logic Programming Language CAL,\u201d inProc. Int. Conf. on Fifth Generation Computer Systems, pp. 263\u2013276, 1988.","DOI":"10.1007\/978-1-4471-3156-4_27"},{"key":"BF03038312_CR3","unstructured":"Baker, N. and S\u00f8ndergaard, H., \u201cDefiniteness Analysis Analysis for CLPR,\u201dTechnical Report, 92\/25, University of Melbourne, 1992."},{"key":"BF03038312_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"Bruynooghe, M., \u201cA Practical Framework for the Abstract Interpretation of Logic Programs,\u201dJournal of Logic Programming, 10, pp. 91\u2013124, 1991.","journal-title":"Journal of Logic Programming"},{"issue":"7","key":"BF03038312_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/79204.79210","volume":"33","author":"A. Colmerauer","year":"1990","unstructured":"Colmerauer, A., \u201cAn Introduction to Prolog III,\u201dCommunications of the ACM, 33, 7, pp. 69\u201390, 1990.","journal-title":"Communications of the ACM"},{"key":"BF03038312_CR6","doi-asserted-by":"crossref","unstructured":"Cortesi, A., File, G., and Winsborough, W., \u201cProp Revisited: Propositional Formula as Abstract Domain for Groundness Analysis,\u201d inProc. IEEE Symposium on Logic in Computer Science, pp. 322\u2013327, 1991.","DOI":"10.1109\/LICS.1991.151656"},{"key":"BF03038312_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P. and Cousot, R., \u201cAbstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction of Approximation of Fixpoints,\u201d inProc. of the 4th ACM Symposium on Principles of Programming Languages, pp. 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"issue":"3","key":"BF03038312_CR8","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1145\/65979.65983","volume":"11","author":"S. K. Debray","year":"1989","unstructured":"Debray, S. K., \u201cStatic Inference of Modes and Data Dependencies in Logic Programs,\u201dACM Transactions on Programming Languages and Systems, 11, 3, pp. 418\u2013450. 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF03038312_CR9","unstructured":"Garc\u00eda de la Banda and Hermenegildo, M., \u201cA Practical Approach to the Global Analysis of CLP Programs,\u201d inProc. International Logic Programming Symposium, Vancouver, MIT Press, pp. 437\u2013455, 1993."},{"key":"BF03038312_CR10","doi-asserted-by":"crossref","unstructured":"Hanus, M., \u201cParametric Order-Sorted Types in Logic Programming,\u201d inProc. of the TAPSOFT \u201991, Springer LNCS 494, pp. 181\u2013200, 1991.","DOI":"10.1007\/3540539816_67"},{"key":"BF03038312_CR11","unstructured":"Hanus, M., \u201cOn the Completeness of Residuation,\u201d inProc. of the 1992 Joint International Conference and Symposium on Logic Programming, MIT Press, pp. 192\u2013206, 1992."},{"key":"BF03038312_CR12","unstructured":"Hanus, M., \u201cAnalysis of Nonlinear Constraints in CLPR,\u201d inProc. Tenth International Conference on Logic Programming, MIT Press, pp. 83\u201399, 1993."},{"key":"BF03038312_CR13","volume-title":"The CLPR Programmer\u2019s Manual, Version 1.1","author":"N. Heintze","year":"1991","unstructured":"Heintze, N., Jaffar, J., Michaylov, S., Stuckey, P., and Yap, R.,The CLP R Programmer\u2019s Manual, Version 1.1, IBM Thomas J. Watson Research Center, Yorktown Heights, 1991."},{"key":"BF03038312_CR14","doi-asserted-by":"crossref","unstructured":"Hong, H., \u201cNon-Linear Real Constraints in Constraint Logic Programming,\u201d inProc. of the 3rd International Conference on Algebraic and Logic Programming, Springer LNCS 632, pp. 201\u2013212, 1992.","DOI":"10.1007\/BFb0013827"},{"key":"BF03038312_CR15","doi-asserted-by":"crossref","unstructured":"Jaffar, J. and Lassez, J.-L., \u201cConstraint Logic Programming,\u201d inProc. of the 14th ACM Symposium on Principles of Programming Languages, Munich, pp. 111\u2013119, 1987.","DOI":"10.1145\/41625.41635"},{"key":"BF03038312_CR16","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Michaylov, S., Stuckey, P. J., and Yap, R. H. C., \u201cAn Abstract Machine for CLPR,\u201d inProc. SIGPLAN Conference on Programming Language Design and Implementation, SIGPLAN Notices, 27, 7, pp. 128\u2013139. 1992.","DOI":"10.1145\/143103.143127"},{"issue":"3","key":"BF03038312_CR17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J. Jaffar","year":"1992","unstructured":"Jaffar, J., Michaylov, S., Stuckey, P.J., and Yap, R. H. C., \u201cThe CLPR Language and System,\u201dACM Transactions on Programming Languages and Systems, 14,3, pp. 339\u2013395, 1992.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"BF03038312_CR18","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Michaylov, S., and Yap, R. H. C., \u201cA Methodology for Managing Hard Constraints in CLP Systems,\u201d inProc. ACM SIGPLAN\u201991 Conference on Programming Language Design and Implementation, SIGPLAN Notices, 26, 6, pp. 306\u2013316, 1991.","DOI":"10.1145\/113446.113471"},{"key":"BF03038312_CR19","unstructured":"J\u00f8rgensen, N., Marriott, K., and Michaylov, S., \u201cSome Global Compile-Time Optimizations for CLPR,\u201d, inProc. 1991 International Logic Programming Symposium, MIT Press, pp. 420\u2013434, 1991."},{"key":"BF03038312_CR20","unstructured":"Le Charlier, B., Musumbu, K., and Van Hentenryck, P., \u201cA Generic Abstract Interpretation Algorithm and Its Complexity Analysis,\u201d inProc. International Conference on Logic Programming, MIT Press, pp. 64\u201378, 1991."},{"key":"BF03038312_CR21","unstructured":"Marriott, K. and S\u00f8ndergaard, H., \u201cAnalysis of Constraint Logic Programs,\u201d inProc. of the 1990 North American Conference on Logic Programming, MIT Press, pp.531\u2013547, 1990."},{"key":"BF03038312_CR22","unstructured":"Marriott, K., S\u00f8ndergaard, H., and Dart, P., \u201cA Characterization of Non-Floundering Logic Programs,\u201d inProc. of the 1990 North American Conference on Logic Programming, MIT Press, pp. 661\u2013680, 1990."},{"key":"BF03038312_CR23","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0743-1066(85)90004-4","volume":"1","author":"C. S. Mellish","year":"1985","unstructured":"Mellish, C. S., \u201cSome Global Optimizations for a Prolog Compiler,\u201dJournal of Logic Programming, 1, pp. 43\u201366, 1985.","journal-title":"Journal of Logic Programming"},{"key":"BF03038312_CR24","doi-asserted-by":"crossref","unstructured":"Nilsson, U., \u201cTowards a Framework for the Abstract Interpretation of Logic Programs,\u201d inProc. of the Workshop on Programming Language Implementation and Logic Programming, Springer LNCS 348, Orl\u00e9ans, pp. 68\u201382, 1988.","DOI":"10.1007\/3-540-50820-1_41"},{"key":"BF03038312_CR25","doi-asserted-by":"crossref","unstructured":"Nilsson, U., \u201cSystematic Semantic Approximations of Logic Programs,\u201d inProc. of the 2nd Int. Workshop on Programming Language Implementation and Logic Programming, Springer LNCS 456, pp. 293\u2013306, 1990.","DOI":"10.1007\/BFb0024191"},{"key":"BF03038312_CR26","unstructured":"Pfenning, F., ed.,Types in Logic Programming, MIT Press, 1992."},{"key":"BF03038312_CR27","unstructured":"Van Hentenryck, P.,Constraint Satisfaction in Logic Programming, MIT Press, 1989."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03038312.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03038312\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03038312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T20:52:44Z","timestamp":1558558364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03038312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF03038312"],"URL":"https:\/\/doi.org\/10.1007\/bf03038312","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}