{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:02:58Z","timestamp":1743098578864,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319296036"},{"type":"electronic","value":"9783319296043"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29604-3_1","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T12:53:12Z","timestamp":1455972792000},"page":"1-11","source":"Crossref","is-referenced-by-count":0,"title":["Logic\/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer Project"],"prefix":"10.1007","author":[{"given":"Kazunori","family":"Ueda","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,21]]},"reference":[{"issue":"9","key":"1_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/1810891.1810910","volume":"53","author":"J Armstrong","year":"2010","unstructured":"Armstrong, J.: Erlang. Commun. ACM 53(9), 68\u201375 (2010)","journal-title":"Commun. ACM"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-47993-7_18","volume-title":"ECOOP 2002 - Object-Oriented Programming","author":"N Benton","year":"2002","unstructured":"Benton, N., Cardelli, L., Fournet, C.: Modern concurrency abstractions for C $${}^{\\sharp }$$ . In: Magnusson, B. (ed.) ECOOP 2002. LNCS, vol. 2374, pp. 415\u2013440. Springer, Heidelberg (2002)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Chandy, K.M., Kesselman, C.: CC++: A Declarative Concurrent Object-Oriented Programming Notation. In: Research Directions in Concurrent Object-Oriented Programming, The MIT Press, 281\u2013313 (1993)","DOI":"10.7551\/mitpress\/2087.003.0016"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Charles, P., et al.: X10: An object-oriented approach to non-uniform cluster computing. In: OOPSLA 2005, pp. 519\u2013538. ACM (2005)","DOI":"10.1145\/1103845.1094852"},{"issue":"1","key":"1_CR5","first-page":"51","volume":"1","author":"I Foster","year":"1992","unstructured":"Foster, I., Olson, R., Tuecke, S.: Productive parallel programming: The PCN approach. Sci. Program. 1(1), 51\u201366 (1992)","journal-title":"Sci. Program."},{"issue":"1\u20133","key":"1_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and practice of Constraint Handling Rules. J. Log. Program. 37(1\u20133), 95\u2013138 (1998)","journal-title":"J. Log. Program."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60472-3_12","volume-title":"Hybrid Systems II","author":"V Gupta","year":"1995","unstructured":"Gupta, V., Jagadeesan, R., Saraswat, V., Bobrow, D.G.: Programming in hybrid constraint languages. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994. LNCS, vol. 999. Springer, Heidelberg (1995)"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/153520.153541","volume":"36","author":"K Fuchi","year":"1993","unstructured":"Fuchi, K., Kowalski, R., Furukawa, K., Ueda, K., Kahn, K., Chikayama, T., Tick, E.: Launching the new era. Commun. ACM 36(3), 49\u2013100 (1993)","journal-title":"Commun. ACM"},{"key":"1_CR9","unstructured":"Fujita, H., Hasegawa, R.: A model-generation theorem prover in KL1 using a ramified stack algorithm. In: 8th International Conference on Logic Programming (ICLP\u201991), pp. 535\u2013548. The MIT Press (1991)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-45632-5_8","volume-title":"Computational Logic: Logic Programming and Beyond","author":"R Hasegawa","year":"2002","unstructured":"Hasegawa, R., Fujita, H., Koshimura, M., Shirai, Y.: A model generation based theorem prover MGTP for first-order logic. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 178\u2013213. Springer, Heidelberg (2002)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Johnson, E., Gannon, D.: HPC++: Experiments with the parallel standard template library. In: 11th International Conference on Supercomputing, pp. 124\u2013131. ACM (1997)","DOI":"10.1145\/263580.263614"},{"key":"1_CR12","unstructured":"Maher, M.J.: Logic semantics for a class of committed-choice programs. In: Fourth International Conferenceon Logic Programming (ICLP\u201987), pp. 858\u2013876. The MIT Press (1987)"},{"key":"1_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626661","volume-title":"The Space and Motion of Communicating Agents","author":"R Milner","year":"2009","unstructured":"Milner, R.: The Space and Motion of Communicating Agents. The Cambridge University Press, Cambridge (2009)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A., Rinard, M.: Concurrent constraint programming (Extended Abstract). In: POPL 1990, pp. 232\u2013245. ACM (1990)","DOI":"10.1145\/96709.96733"},{"key":"1_CR15","unstructured":"Shapiro, E.Y.: A Subset of Concurrent Prolog and Its Interpreter. ICOT Tech. Report TR-003, Institute for New Generation Computer Technology (ICOT), Tokyo (1983)"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0743-1066(94)00038-8","volume":"23","author":"E Tick","year":"1995","unstructured":"Tick, E.: The deevolution of concurrent logic programming languages. J. Log. Program. 23(2), 89\u2013123 (1995)","journal-title":"J. Log. Program."},{"key":"1_CR17","unstructured":"Ueda, K.: Guarded Horn Clauses. ICOT Technical Report TR-103, Institute for New Generation Computer Technology (ICOT), Tokyo (1985). In: Wada, E. (ed.) Logic Programming. LNCS, vol. 221, pp. 168\u2013179. Springer, Heidelberg (1986)"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF03038307","volume":"13","author":"K Ueda","year":"1994","unstructured":"Ueda, K., Morita, M.: Moded Flat GHC and its message-oriented implementation technique. New Gener. Comput. 13(1), 3\u201343 (1994)","journal-title":"New Gener. Comput."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-60085-2_3","volume-title":"The Logic Programming Paradigm: A 25-Year Perspective","author":"K Ueda","year":"1999","unstructured":"Ueda, K.: Concurrent logic\/constraint programming: The next 10 years. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm: A 25-Year Perspective, pp. 53\u201371. Springer, Heidelberg (1999)"},{"issue":"2","key":"1_CR20","first-page":"37","volume":"19","author":"K Ueda","year":"2006","unstructured":"Ueda, K.: Logic programming and concurrency: A personal perspective. ALP News Lett. 19(2), 37\u201352 (2006)","journal-title":"ALP News Lett."},{"issue":"3","key":"1_CR21","first-page":"49","volume":"25","author":"K Ueda","year":"2008","unstructured":"Ueda, K.: Logic and constraint programming versus concurrency. Comput. Softw. 25(3), 49\u201354 (2008). http:\/\/doi.org\/10.11309\/jssst.25.3_49","journal-title":"Comput. Softw."},{"issue":"46","key":"1_CR22","doi-asserted-by":"publisher","first-page":"4784","DOI":"10.1016\/j.tcs.2009.07.043","volume":"410","author":"K Ueda","year":"2009","unstructured":"Ueda, K.: LMNtal as a hierarchical logic programming language. Theor. Comput. Sci. 410(46), 4784\u20134800 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-03466-4_24","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"K Ueda","year":"2009","unstructured":"Ueda, K., Ayano, T., Hori, T., Iwasawa, H., Ogawa, S.: Hierarchical graph rewriting as a unifying tool for analyzing and understanding nondeterministic systems. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 349\u2013355. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29604-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T14:01:36Z","timestamp":1718373696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29604-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319296036","9783319296043"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29604-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}