{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:47:00Z","timestamp":1768164420946,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031712937","type":"print"},{"value":"9783031712944","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-71294-4_13","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:03:47Z","timestamp":1725631427000},"page":"220-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Introducing Quantification into a\u00a0Hierarchical Graph Rewriting Language"],"prefix":"10.1007","author":[{"given":"Haruto","family":"Mishina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3424-1844","authenticated-orcid":false,"given":"Kazunori","family":"Ueda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Balasubramanian, D., Narayanan, A., Buskirk, C., Karsai, G.: The graph rewriting and transformation language: GReAT. Electronic Communications of the EASST 1 (2006). https:\/\/doi.org\/10.14279\/tuj.eceasst.1.89","DOI":"10.14279\/tuj.eceasst.1.89"},{"key":"13_CR2","unstructured":"Blau, H., Immerman, N., Jensen, D.: A visual language for querying and updating graphs. Tech. rep., University of Massachusetts (2002), https:\/\/web.cs.umass.edu\/publication\/docs\/2002\/UM-CS-2002-037.pdf"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Brus, T.H., van Eekelen, M.C.J.D., van Leer, M.O., Plasmeijer, M.J.: Clean \u2014 a language for functional graph rewriting. In: Functional Programming Languages and Computer Architecture (FPCA 1987). LNCS, vol.\u00a0274, pp. 364\u2013384. Springer Berlin Heidelberg (1987)https:\/\/doi.org\/10.1007\/3-540-18317-5_20","DOI":"10.1007\/3-540-18317-5_20"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Desel, J., Reisig, W.: Place\/transition Petri nets. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models: Advances in Petri Nets, pp. 122\u2013173. Springer Berlin Heidelberg (1998) https:\/\/doi.org\/10.1007\/3-540-65306-6_15","DOI":"10.1007\/3-540-65306-6_15"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Fan, W., Wu, Y., Xu, J.: Adding counting quantifiers to graph patterns. In: Proc. SIGMOD\u201916. pp. 1215\u20131230. ACM, New York, NY, USA (2016)https:\/\/doi.org\/10.1145\/2882903.2882937","DOI":"10.1145\/2882903.2882937"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez, M., Kirchner, H., Namet, O.: A strategy language for graph rewriting. In: Vidal, G. (ed.) Logic-Based Program Synthesis and Transformation (LOPSTR 2011). LNCS, vol.\u00a07225, pp. 173\u2013188. Springer Berlin Heidelberg (2012)https:\/\/doi.org\/10.1007\/978-3-642-32211-2_12","DOI":"10.1007\/978-3-642-32211-2_12"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Fr\u00fcwirth, T.: Theory and practice of constraint handling rules. J. Logic Program. 37, 95\u2013138 (1998) https:\/\/doi.org\/10.1016\/S0743-1066(98)10005-5","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Shaub, T.: Answer Set Solving in Practice. Springer Cham (2013) https:\/\/doi.org\/10.1007\/978-3-031-01561-8","DOI":"10.1007\/978-3-031-01561-8"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Gei\u00df, R., Batz, G.V., Grund, D., Hack, S., Szalkowski, A.: GrGen: A fast SPO-based graph rewriting tool. In: Graph Transformations (ICGT 2006). LNCS, vol.\u00a04178, pp. 383\u2013397. Springer Berlin Heidelberg (2006).https:\/\/doi.org\/10.1007\/11841883_27","DOI":"10.1007\/11841883_27"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Ghamarian, A., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using GROOVE. Int. J. Softw. Tools. Technol. Transfer 14, 15\u201340 (2012) https:\/\/doi.org\/10.1007\/s10009-011-0186-x","DOI":"10.1007\/s10009-011-0186-x"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Gocho, M., Hori, T., Ueda, K.: Evolution of the LMNtal runtime to a parallel model checker. Computer Software 28(4), 4_137\u20134_157 (2011).https:\/\/doi.org\/10.11309\/jssst.28.4_137","DOI":"10.11309\/jssst.28.4_137"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Matsuda, K., Asada, K.: A functional reformulation of uncal graph-transformations: or, graph transformation as graph reduction. In: Proc. 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM 2017). pp. 71\u201382. ACM, New York, NY, USA (2017)https:\/\/doi.org\/10.1145\/3018882.3018883","DOI":"10.1145\/3018882.3018883"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Plump, D.: The design of GP 2. Electronic Proceedings in Theoretical Computer Science 82, 1\u201316 (2012) https:\/\/doi.org\/10.4204\/eptcs.82.1","DOI":"10.4204\/eptcs.82.1"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Ranger, U., Weinell, E.: The graph rewriting language and environment progres. In: Applications of Graph Transformations with Industrial Relevance (AGTIVE 2007). LNCS, vol.\u00a05088, pp. 575\u2013576. Springer-Verlag, Berlin, Heidelberg (2008) https:\/\/doi.org\/10.1007\/978-3-540-89020-1_41","DOI":"10.1007\/978-3-540-89020-1_41"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Rensink, A., Kuperus, J.H.: Repotting the geraniums: On nested graph transformation rules. Electronic Communications of the EASST 18 (2009) https:\/\/doi.org\/10.14279\/tuj.eceasst.18.260.262","DOI":"10.14279\/tuj.eceasst.18.260.262"},{"key":"13_CR16","unstructured":"Saito, R., Ueda, K.: An enhancement of negative expression and realization of universal quantification for LMNtal, a hierarchical graph rewriting language. In: Proc. 35th Conference of Japan Society for Software Science and Technology (JSSST) (2018), http:\/\/jssst.or.jp\/files\/user\/taikai\/2018\/PPL\/ppl5-1.pdf, (in Japanese)"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Sano, J., Ueda, K.: Implementing the $$\\lambda _{GT}$$ language: A functional language with graphs as first-class data. In: Graph Transformation (ICGT 2023). LNCS, vol. 13961, pp. 263\u2013277. Springer, Cham (2023).https:\/\/doi.org\/10.1007\/978-3-031-36709-0_14","DOI":"10.1007\/978-3-031-36709-0_14"},{"issue":"46","key":"13_CR18","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. Theoret. Comput. Sci. 410(46), 4784\u20134800 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.07.043","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Ueda, K.: Logic\/constraint programming and concurrency: The hard-won lessons of the fifth generation computer project. Science of Computer Programming 164, 3\u201317 (2018) https:\/\/doi.org\/10.1016\/j.scico.2017.06.002","DOI":"10.1016\/j.scico.2017.06.002"},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.scico.2007.05.004","volume":"68","author":"D Varr\u00f3","year":"2007","unstructured":"Varr\u00f3, D., Balogh, A.: The model transformation language of the VIATRA2 framework. Sci. Comput. Program. 68(3), 214\u2013234 (2007). https:\/\/doi.org\/10.1016\/j.scico.2007.05.004","journal-title":"Sci. Comput. Program."},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"114612","DOI":"10.1109\/ACCESS.2022.3217913","volume":"10","author":"N Yamamoto","year":"2022","unstructured":"Yamamoto, N., Ueda, K.: Engineering grammar-based type checking for graph rewriting languages. IEEE Access 10, 114612\u2013114628 (2022). https:\/\/doi.org\/10.1109\/ACCESS.2022.3217913","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71294-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:05:42Z","timestamp":1725631542000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71294-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031712937","9783031712944"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71294-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.fm24.polimi.it\/?page_id=63#lopstrppdp2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}