{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:31Z","timestamp":1725488491515},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638759"},{"type":"electronic","value":"9783540696582"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63875-x_58","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T03:08:01Z","timestamp":1186456081000},"page":"268-282","source":"Crossref","is-referenced-by-count":1,"title":["Efficient goal scheduling in a concurrent logic language using type-based dependency analysis"],"prefix":"10.1007","author":[{"given":"Kazuhiko","family":"Ohno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiko","family":"Ikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Goshimai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichiro","family":"Mori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nakashima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Tomita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,8,1]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"K. Ueda. Guarded horn clauses. In LNCS221 Logic Programming '85, pp. 168\u2013179. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16479-0_17"},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1093\/comjnl\/33.6.494","volume":"33","author":"K. Ueda","year":"1990","unstructured":"K. Ueda and T. Chikayama. Design of the kernel language for the parallel inference machine. The Computer Journal, Vol. 33, No. 6, pp. 494\u2013500, 1990.","journal-title":"The Computer Journal"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"T. Chikayama, T. Fujise, and D. Sekita. A portable and efficient implementation of KL1. In Proc. 6th Intl. Symp. PLILP'94, pp. 25\u201339, 1994.","DOI":"10.1007\/3-540-58402-1_4"},{"key":"21_CR4","unstructured":"Takashi Chikayama. KLIC User's Manual. ICOT, March 1995."},{"key":"21_CR5","unstructured":"K. Nakajima, Y. Inamura, N. Ichiyoshi, K. Rokusawa, and T. Chikayama. Distributed implementation of KL1 on the Multi-PSI\/V2. In Proc. 6th Intl. Conf. and Symp. on Logic Programming, pp. 436\u2013451, 1989."},{"key":"21_CR6","unstructured":"T. Chikayama. Operating system PIMOS and kernel language KL1. In FGCS'92, pp. 73\u201388, 1992."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Klaus E. Schauser, David E. Culler, and Seth C. Goldstein. Separation constraint partitioning \u2014 a new algorithm for partitioning non-strict programs into sequential threads. In POPL'95, pp. 259\u2013271, 1995.","DOI":"10.1145\/199448.199511"},{"issue":"1","key":"21_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF03038307","volume":"13","author":"K. Ueda","year":"1994","unstructured":"K. Ueda and M. Morita. Moded Flat GHC and its message-oriented implementation technique. New Generation Computing, Vol. 13, No. 1, pp. 3\u201343, November 1994.","journal-title":"New Generation Computing"},{"key":"21_CR9","unstructured":"D. H. D. Warren. An abstract prolog instruction set. Technical Report 309, SRI International, 1983."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"K. Marriott, M. Garcia de la Banda, and M. Hermenegildo. Analyzing logic programs with dynamic scheduling. In POPL'94, 1994.","DOI":"10.1145\/174675.177883"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"G. Puebla and M. Hermenegildo. Automatic optimization of dynamic scheduling in logic programs. In LNCS1140 PLILP'96, pp. 475\u2013476. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61756-6_107"},{"key":"21_CR12","unstructured":"A.King and P.Soper. Schedule analysis of concurrent logic programs. In Proc. of the Joint Intl. Conf. and Symp. on Logic Programming, pp. 478\u2013492, 1994."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"B. C. Massey and E. Tick. Sequentialization of parallel logic programs with mode analysis. In 4th International Conference on Logic Programming and Automated Reasoning, pp. 205\u2013216, 1993.","DOI":"10.1007\/3-540-56944-8_54"},{"key":"21_CR14","unstructured":"T. Araki and H. Tanaka. A static granularity optimization method of a committed-choice language Fleng(In Japanese). In IPSJ 96-PRO-8, pp. 109\u2013114, August 1996."},{"key":"21_CR15","unstructured":"M. Nilsson and H. Tanaka. Fleng prolog-the language which turns supercomputers into prolog machines. In LNCS264. Springer-Verlag, 1989."}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2014 ASIAN'97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63875-X_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:10:38Z","timestamp":1556727038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63875-X_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638759","9783540696582"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-63875-x_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}