{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T08:10:15Z","timestamp":1706775015286},"reference-count":40,"publisher":"Wiley","issue":"13","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5783,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw: Pract. Exper."],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1002\/(sici)1097-024x(199911)29:13<1173::aid-spe276>3.0.co;2-x","type":"journal-article","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T19:54:36Z","timestamp":1133466876000},"page":"1173-1200","source":"Crossref","is-referenced-by-count":0,"title":["Declarative solutions to partitioned-grid problems"],"prefix":"10.1002","volume":"29","author":[{"given":"Sandro","family":"Etalle","sequence":"first","affiliation":[]},{"given":"Pieter H.","family":"Hartel","sequence":"additional","affiliation":[]},{"given":"Willem G.","family":"Vree","sequence":"additional","affiliation":[]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1177\/109434208800200402","volume":"2","author":"Meurant","year":"1988","journal-title":"Int. J. Supercomputer Applications"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971507","volume-title":"Domain Based Parallelism and Problem Decomposition Methods in Computational Science and Engineering","author":"Keyes","year":"1995","unstructured":"and (editors), Domain Based Parallelism and Problem Decomposition Methods in Computational Science and Engineering, SIAM, Philadephia, 1995."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Somogyi","year":"1996","journal-title":"J. Logic Programming"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00264249","volume":"21","author":"Bird","year":"1984","journal-title":"Acta Informatica"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB5","author":"Stelling","year":"1983","unstructured":"\u2018On the construction of computational methods for shallow water flow problems\u2019, PhD thesis, Delft Technical University, 1983."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB6","first-page":"363","volume-title":"Parallel Processing and Applications","author":"Vree","year":"1987","unstructured":"\u2018The grain size of parallel computations in a functional program\u2019, in and , editors, Parallel Processing and Applications, L'Aquila, Italy, September 1987, pp. 363-370."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB7","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1017\/S0956796800001477","volume":"5","author":"Vree","year":"1995","journal-title":"J. Functional Programming"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0096-0551(94)90003-5","volume":"20","author":"Hartel","year":"1994","journal-title":"Computer languages"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB9","first-page":"29","volume-title":"Mathematical Logic and Programming Languages","author":"Turner","year":"1984","unstructured":"\u2018Functional programs as executable specifications\u2019, in and , editors, Mathematical Logic and Programming Languages, Prentice Hall, London, UK, February, 1984, pp. 29-54."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB10","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/3-540-18317-5_10","volume-title":"3rd Int. Conf. Functional Programming Languages and Computer Architecture","author":"Johnsson","year":"1987","unstructured":"\u2018Attribute grammars as a functional programming paradigm\u2019, in editor, 3rd Int. Conf. Functional Programming Languages and Computer Architecture, LNCS 274, Portland, OR, Springer-Verlag, Berlin, September, 1987, pp. 154-13."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB11","series-title":"LNCS","first-page":"1","volume-title":"Mathematical Foundations of Computer Science (MFCS)","author":"Apt","year":"1993","unstructured":"and , \u2018On the unification free Prolog programs\u2019, in and , editors, Mathematical Foundations of Computer Science (MFCS), LNCS 711, Gdansk, Poland, Springer-Verlag, Berlin, August, 1993, pp. 1-19."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB12","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-58431-5_16","volume-title":"Algebraic and Logic Programming (ALP)","author":"Marchiori","year":"1994","unstructured":"\u2018Logic programs as term rewriting systems.\u2019, in and , editors, Algebraic and Logic Programming (ALP), LNCS 850, Madrid, Spain, Springer-Verlag, Berlin, September, 1994, pp. 223-241."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB13","first-page":"55","volume-title":"7th Int. Conf. Functional Programming Languages and Computer Architecture (FPCA)","author":"Marchiori","year":"1995","unstructured":"\u2018The functional side of logic programming.\u2019, 7th Int. Conf. Functional Programming Languages and Computer Architecture (FPCA), La Jolla, CA, ACM, New York, June, 1995, pp. 55-65."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB14","series-title":"LNCS","first-page":"430","volume-title":"3rd Int. Conf. Conditional Term Rewriting Systems","author":"Ganzinger","year":"1992","unstructured":"and , \u2018Termination proofs of Well-Moded logic programs via conditional rewrite systems\u2019, in and , editors, 3rd Int. Conf. Conditional Term Rewriting Systems, LNCS 656, Pont-\u00e0-Mousson, France, Springer-Verlag, Berlin, July, 1992, pp. 430-437."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(97)00028-9","volume":"34","author":"Krishna Rao","year":"1998","journal-title":"J. Logic Programming"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB16","first-page":"187","volume-title":"Symp. Logic Programming","author":"Reddy","year":"1984","unstructured":"\u2018Transformation of logic programs into functional programs\u2019, Symp. Logic Programming, Atlantic City, NJ, IEEE Computer Society, Silver Spring, MD., February, 1984, pp. 187-196."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB17","doi-asserted-by":"crossref","first-page":"168","DOI":"10.7551\/mitpress\/4299.003.0018","volume-title":"14th Int. Conf. Logic Programming","author":"van Raamsdonk","year":"1997","unstructured":"\u2018Translating logic programs into conditional rewriting systems\u2019, in editor, 14th Int. Conf. Logic Programming, Manchester, UK, MIT Press, Cambridge, MA, July, 1997, pp. 168-182."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB18","volume-title":"Foundations of Logic Programming, 2nd edition","author":"Lloyd","year":"1993","unstructured":"Foundations of Logic Programming, 2nd edition, Springer-Verlag, Berlin, 1993."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB19","first-page":"495","volume-title":"Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics","author":"Apt","year":"1990","unstructured":"\u2018Introduction to logic programming.\u2019, in editor, Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier, Amsterdam, MIT Press, Cambridge, MA, 1990, pp. 495-574."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB20","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/BF01213601","volume":"6","author":"Apt","year":"1994","journal-title":"Formal Aspects of Computing"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB21","series-title":"LNCS","first-page":"213","volume-title":"Fifth Computer Science Logic (CSL)","author":"Krishna Rao","year":"1991","unstructured":"and , \u2018A transformational methodology for proving termination of logic programs\u2019, Fifth Computer Science Logic (CSL), LNCS 626, Berne, Switzerland, Springer-Verlag, Berlin, October, 1991, pp. 213-226."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB22","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF03037949","volume":"15","author":"Krishna Rao","year":"1997","journal-title":"New Generation Computing"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01543289","volume":"12","author":"Heemink","year":"1990","journal-title":"Stochastic hydrology and hydraulics"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB24","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-15975-4_26","volume-title":"2nd Int. Conf. Functional Programming Languages and Computer Architecture","author":"Turner","year":"1985","unstructured":"\u2018Miranda: A non-strict functional language with polymorphic types\u2019, in editor, 2nd Int. Conf. Functional Programming Languages and Computer Architecture, LNCS 201, Nancy, France, Springer-Verlag, Berlin, September, 1985, pp. 1-16."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB25","author":"Carlsson","year":"1993","unstructured":", , , , and , \u2018SICStus Prolog Users's Manual\u2019, Swedish Institute of Comp. Science, Kista, Sweden, January, 1993."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB26","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/spe.4380240202","volume":"24","author":"Hartel","year":"1994","journal-title":"Software\u2014Practice and Experience"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB27","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1002\/cpe.4330070803","volume":"7","author":"Hartel","year":"1995","journal-title":"Concurrency: Practice and Experience"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB28","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19\/20","author":"Hanus","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB29","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(86)90014-2","volume":"3","author":"Bellia","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB30","first-page":"321","volume-title":"Joint Int. Conf. and Symp. on Logic Programming (JICSLP)","author":"Bronsard","year":"1992","unstructured":"and , \u2018A framework of directionality for proving termination of logic programs\u2019, in editor, Joint Int. Conf. and Symp. on Logic Programming (JICSLP), Washington DC, MIT Press, Cambridge, MA, November, 1992, pp. 321-335."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(83)90035-2","volume":"17","author":"Clocksin","year":"1983","journal-title":"Information Processing Letters"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB32","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(91)90191-4","volume":"81","author":"Pingali","year":"1991","journal-title":"Theoretical Computer Science"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB33","first-page":"233","volume-title":"Artificial Intelligence in Mathematics","author":"Knott","year":"1994","unstructured":"\u2018Declarative programming for mathematical exploration\u2019, in and , editors, Artificial Intelligence in Mathematics, Clarendon Press, Oxford, 1994, pp. 233-250."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB34","author":"Nikhil","year":"1991","unstructured":"\u2018ID version 90.1 reference manual\u2019, Computation Structures Group Memo 284-2, Laboratory for Computer Science, MIT, Cambridge MA, July, 1991."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB35","author":"Nikhil","year":"1995","unstructured":", , , , and , \u2018pH language reference manual, version 1.0-preliminary\u2019, Computation Structures Group Memo 369, Laboratory for Computer Science, MIT, Cambridge MA, January, 1995."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB36","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1145\/69558.69562","volume":"11","author":"Arvind","year":"1989","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB37","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/3540543961_26","volume-title":"5th Int. Conf. Functional Programming Languages and Computer Architecture","author":"Barth","year":"1991","unstructured":"and , \u2018M-structures: Extending a parallel, non-strict, functional language with state\u2019, in editor, 5th Int. Conf. Functional Programming Languages and Computer Architecture, LNCS 523, Cambridge, MA, Springer-Verlag, Berlin, September, 1991, pp. 538-568."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB38","author":"Peyton Jones","year":"1993","unstructured":", , and , \u2018The Glasgow Haskell compiler: a technical overview\u2019, Joint Framework for Information Technology (JFIT) Technical Conf., Keele, UK, March, 1993, pp. 249-257. DTI\/SERC."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB39","author":"Heemink","year":"1986","unstructured":"\u2018Storm surge prediction using Kalman filtering\u2019, PhD thesis, Twente Technical University, September, 1986."},{"key":"10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X-BIB40","volume-title":"Mathematical Centre Tracts 20","author":"van der Houwen","year":"1968","unstructured":"\u2018Finite difference methods for solving partial differential equations\u2019, Mathematical Centre Tracts 20, Mathematical Centre, Amsterdam, 1968."}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-024X(199911)29:13%3C1173::AID-SPE276%3E3.0.CO;2-X","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-024X(199911)29:13%3C1173::AID-SPE276%3E3.0.CO;2-X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T07:56:48Z","timestamp":1706774208000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":40,"journal-issue":{"issue":"13","published-print":{"date-parts":[[1999,11]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-024x(199911)29:13<1173::aid-spe276>3.0.co;2-x","relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}