{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:01:49Z","timestamp":1725494509724},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341755"},{"type":"electronic","value":"9783642341762"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34176-2_12","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T01:56:59Z","timestamp":1349056619000},"page":"121-136","source":"Crossref","is-referenced-by-count":1,"title":["Graph Grammar Induction as a Parser-Controlled Heuristic Search Process"],"prefix":"10.1007","author":[{"given":"Luka","family":"F\u00fcrst","sequence":"first","affiliation":[]},{"given":"Marjan","family":"Mernik","sequence":"additional","affiliation":[]},{"given":"Viljan","family":"Mahni\u010d","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-89020-1_3","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"N. Aschenbrenner","year":"2008","unstructured":"Aschenbrenner, N., Geiger, L.: Transforming Scene Graphs Using Triple Graph Grammars \u2013 A Practice Report. In: Sch\u00fcrr, A., Nagl, M., Z\u00fcndorf, A. (eds.) AGTIVE 2007. LNCS, vol.\u00a05088, pp. 32\u201343. Springer, Heidelberg (2008)"},{"key":"12_CR2","first-page":"232","volume-title":"Proc. of the 18th IEEE International Conference on Tools with Artificial Intelligence","author":"K. Ates","year":"2006","unstructured":"Ates, K., Kukluk, J.P., Holder, L.B., Cook, D.J., Zhang, K.: Graph grammar induction on structural data for visual programming. In: Proc. of the 18th IEEE International Conference on Tools with Artificial Intelligence, pp. 232\u2013242. IEEE Computer Society, Washington, DC (2006)"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10270-008-0092-1","volume":"8","author":"Z. Balogh","year":"2009","unstructured":"Balogh, Z., Varr\u00f3, D.: Model transformation by example using inductive logic programming. Software and Systems Modeling\u00a08(3), 347\u2013364 (2009)","journal-title":"Software and Systems Modeling"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Brijder, R., Blockeel, H.: On the inference of non-confluent NLC graph grammars. Journal of Logic and Computation (to appear, 2012)","DOI":"10.1093\/logcom\/exr046"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-540-89020-1_24","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"T. Buchmann","year":"2008","unstructured":"Buchmann, T., Dotor, A., Uhrig, S., Westfechtel, B.: Model-Driven Software Development with Graph Transformations: A Comparative Case Study. In: Sch\u00fcrr, A., Nagl, M., Z\u00fcndorf, A. (eds.) AGTIVE 2007. LNCS, vol.\u00a05088, pp. 345\u2013360. Springer, Heidelberg (2008)"},{"key":"12_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0470073047","volume-title":"Mining Graph Data","author":"D.J. Cook","year":"2006","unstructured":"Cook, D.J., Holder, L.B.: Mining Graph Data. John Wiley & Sons, New Jersey (2006)"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1049\/iet-sen:20070061","volume":"2","author":"A. Dubey","year":"2008","unstructured":"Dubey, A., Jalote, P., Aggarwal, S.K.: Learning context-free grammar rules from a set of programs. IET Software\u00a02(3), 223\u2013240 (2008)","journal-title":"IET Software"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1049\/iet-sen.2010.0081","volume":"5","author":"L. F\u00fcrst","year":"2011","unstructured":"F\u00fcrst, L., Mernik, M., Mahni\u010d, V.: Improving the graph grammar parser of Rekers and Sch\u00fcrr. IET Software\u00a05(2), 246\u2013261 (2011)","journal-title":"IET Software"},{"issue":"9-10","key":"12_CR9","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1016\/j.infsof.2007.08.003","volume":"50","author":"F. Javed","year":"2008","unstructured":"Javed, F., Mernik, M., Gray, J., Bryant, B.R.: MARS: A metamodel recovery system using grammar inference. Information and Software Technology\u00a050(9-10), 948\u2013968 (2008)","journal-title":"Information and Software Technology"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BFb0017406","volume-title":"Graph Grammars and Their Application to Computer Science","author":"E. Jeltsch","year":"1991","unstructured":"Jeltsch, E., Kreowski, H.J.: Grammatical Inference Based on Hyperedge Replacement. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol.\u00a0532, pp. 461\u2013474. Springer, Heidelberg (1991)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1142\/S0218213004001429","volume":"13","author":"I. Jonyer","year":"2004","unstructured":"Jonyer, I., Holder, L.B., Cook, D.J.: MDL-based context-free graph grammar induction and applications. International Journal of Artificial Intelligence Tools\u00a013(1), 65\u201379 (2004)","journal-title":"International Journal of Artificial Intelligence Tools"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/1165734.1165739","volume":"13","author":"J. Kong","year":"2006","unstructured":"Kong, J., Zhang, K., Zeng, X.: Spatial graph grammars for graphical user interfaces. ACM Transactions on Computer\u2013Human Interaction\u00a013(2), 268\u2013307 (2006)","journal-title":"ACM Transactions on Computer\u2013Human Interaction"},{"issue":"2","key":"12_CR13","first-page":"241","volume":"18","author":"J.P. Kukluk","year":"2008","unstructured":"Kukluk, J.P., Holder, L.B., Cook, D.J.: Inferring graph grammars by detecting overlap in frequent subgraphs. Applied Mathematics and Computer Science\u00a018(2), 241\u2013250 (2008)","journal-title":"Applied Mathematics and Computer Science"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M. Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Mining and Knowledge Discovery\u00a011(3), 243\u2013271 (2005)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"9","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1016\/j.patcog.2005.01.004","volume":"38","author":"K. Nakamura","year":"2005","unstructured":"Nakamura, K., Matsumoto, M.: Incremental learning of context free grammars based on bottom-up parsing and search. Pattern Recognition\u00a038(9), 1384\u20131392 (2005)","journal-title":"Pattern Recognition"},{"key":"12_CR16","first-page":"727","volume-title":"Handbook of Natural Language Processing","author":"R. Parekh","year":"2000","unstructured":"Parekh, R., Honavar, V.: Grammar inference, automata induction, and language acquisition. In: Dale, R., Somers, H.L., Moisl, H. (eds.) Handbook of Natural Language Processing, pp. 727\u2013764. Marcel Dekker, New York (2000)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45104-8_1","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"R. Plasmeijer","year":"2000","unstructured":"Plasmeijer, R., van Eekelen, M.: Term Graph Rewriting and Mobile Expressions in Functional Languages. In: Nagl, M., Sch\u00fcrr, A., M\u00fcnch, M. (eds.) AGTIVE 1999. LNCS, vol.\u00a01779, pp. 1\u201313. Springer, Heidelberg (2000)"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1006\/jvlc.1996.0027","volume":"8","author":"J. Rekers","year":"1997","unstructured":"Rekers, J., Sch\u00fcrr, A.: Defining and parsing visual languages with layered graph grammars. Journal of Visual Languages and Computing\u00a08(1), 27\u201355 (1997)","journal-title":"Journal of Visual Languages and Computing"},{"volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations, vol. 1: Foundations","year":"1997","key":"12_CR19","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformations, vol. 1: Foundations. World Scientific, River Edge (1997)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-59071-4_45","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A. Sch\u00fcrr","year":"1995","unstructured":"Sch\u00fcrr, A.: Specification of Graph Translators with Triple Graph Grammars. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol.\u00a0903, pp. 151\u2013163. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Applications of Graph Transformations with Industrial Relevance"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34176-2_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:47:04Z","timestamp":1620118024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34176-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341755","9783642341762"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34176-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}