{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:47:17Z","timestamp":1769971637002,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319753959","type":"print"},{"value":"9783319753966","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75396-6_7","type":"book-chapter","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T21:33:53Z","timestamp":1517866433000},"page":"124-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards a Navigational Logic for Graphical Structures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6937-5167","authenticated-orcid":false,"given":"Leen","family":"Lambers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7937-0236","authenticated-orcid":false,"given":"Marisa","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3023-4006","authenticated-orcid":false,"given":"Fernando","family":"Orejas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3376-5096","authenticated-orcid":false,"given":"Elvira","family":"Pino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,7]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Barcel\u00f3, P.: Querying graph databases. In: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, 22\u201327 June 2013, pp. 175\u2013188 (2013), \nhttps:\/\/doi.org\/10.1145\/2463664.2465216","DOI":"10.1145\/2463664.2465216"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Barcel\u00f3, P., Libkin, L., Reutter, J.L.: Querying graph patterns. In: Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, 12\u201316 June 2011, Athens, pp. 199\u2013210 (2011). \nhttps:\/\/doi.org\/10.1145\/1989284.1989307","DOI":"10.1145\/1989284.1989307"},{"key":"7_CR3","first-page":"313","volume-title":"Handbook of Graph Grammars","author":"B Courcelle","year":"1997","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars, pp. 313\u2013400. World Scientific, River Edge (1997). \nhttps:\/\/dl.acm.org\/citation.cfm?id=278918.278932"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Cruz, I.F., Mendelzon, A.O., Wood, P.T.: A graphical query language supporting recursion. In: Proceedings SIGMOD 1987 Annual Conference, San Francisco, 27\u201329 May 1987, pp. 323\u2013330 (1987). \nhttps:\/\/doi.org\/10.1145\/38713.38749","DOI":"10.1145\/38713.38749"},{"key":"7_CR5","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer, Heidelberg (2006)"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-642-95486-3_7","volume-title":"The Book of L","author":"H Ehrig","year":"1986","unstructured":"Ehrig, H., Habel, A.: Graph grammars with application conditions. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 87\u2013100. Springer, Heidelberg (1986)"},{"key":"7_CR7","unstructured":"Flick, N.E.: On correctness of graph programs relative to recursively nested conditions. In: Workshop on Graph Computation Models (GCM 2015), vol. 1403, pp. 97\u2013112 (2015). \nhttp:\/\/ceur-ws.org\/Vol-1403\/"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.3233\/FI-1996-263404","volume":"26","author":"A Habel","year":"1996","unstructured":"Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26, 287\u2013313 (1996). \nhttps:\/\/doi.org\/10.3233\/FI-1996-263404","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), 245\u2013296 (2009). \nhttps:\/\/doi.org\/10.1017\/S0960129508007202","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Habel, A., Radke, H.: Expressiveness of graph conditions with variables. ECEASST, 30 (2010) \nhttps:\/\/doi.org\/10.14279\/tuj.eceasst.30.404","DOI":"10.14279\/tuj.eceasst.30.404"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S1571-0661(05)80188-4","volume":"2","author":"R Heckel","year":"1995","unstructured":"Heckel, R., Wagner, A.: Ensuring consistency of conditional graph rewriting - a constructive approach. Electr. Notes Theor. Comput. Sci. 2, 118\u2013126 (1995). \nhttps:\/\/doi.org\/10.1016\/S1571-0661(05)80188-4","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-09108-2_2","volume-title":"Graph Transformation","author":"L Lambers","year":"2014","unstructured":"Lambers, L., Orejas, F.: Tableau-Based Reasoning for Graph Properties. In: Giese, H., K\u00f6nig, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 17\u201332. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09108-2_2"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Libkin, L., Vrgoc, D.: Regular path queries on graphs with data. In: 15th International Conference on Database Theory, ICDT 2012, Berlin, 26\u201329 March 2012, pp. 74\u201385 (2012). \nhttps:\/\/doi.org\/10.1145\/2274576.2274585","DOI":"10.1145\/2274576.2274585"},{"key":"7_CR14","unstructured":"Navarro, M., Orejas, F., Pino, E., Lambers, L.: A logic of graph conditions extended with paths. In: Workshop on Graph Computation Models (GCM 2016), Vienna (2016)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-87405-8_19","volume-title":"Graph Transformations","author":"F Orejas","year":"2008","unstructured":"Orejas, F.: Attributed graph constraints. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 274\u2013288. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-87405-8_19"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.jsc.2010.09.009","volume":"46","author":"F Orejas","year":"2011","unstructured":"Orejas, F.: Symbolic graphs for attributed graph constraints. J. Symb. Comput. 46(3), 294\u2013315 (2011). \nhttps:\/\/doi.org\/10.1016\/j.jsc.2010.09.009","journal-title":"J. Symb. Comput."},{"issue":"3\u20134","key":"7_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s00165-009-0116-9","volume":"22","author":"F Orejas","year":"2010","unstructured":"Orejas, F., Ehrig, H., Prange, U.: Reasoning with graph constraints. Formal Asp. Comput. 22(3\u20134), 385\u2013422 (2010). \nhttps:\/\/doi.org\/10.1007\/s00165-009-0116-9","journal-title":"Formal Asp. Comput."},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-87405-8_20","volume-title":"Graph Transformations","author":"K-H Pennemann","year":"2008","unstructured":"Pennemann, K.-H.: Resolution-like theorem proving for high-level conditions. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 289\u2013304. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-87405-8_20"},{"key":"7_CR19","unstructured":"Pennemann, K.H.: Development of Correct Graph Transformation Systems, PhD Thesis. Department of Computing Science, University of Oldenburg (2009)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-09108-2_3","volume-title":"Graph Transformation","author":"CM Poskitt","year":"2014","unstructured":"Poskitt, C.M., Plump, D.: Verifying monadic second-order properties of graph programs. In: Giese, H., K\u00f6nig, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 33\u201348. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-09108-2_3"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-30203-2_23","volume-title":"Graph Transformations","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319\u2013335. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30203-2_23"},{"key":"7_CR22","unstructured":"Trakhtenbrot, B.A.: The impossibility of an algorithm for the decision problem on finite classes (In Russian). Doklady Akademii Nauk SSSR, 70:569\u2013572, 1950. English translation. In: Nine Papers on Logic and Quantum Electrodynamics, AMS Transl. Ser. 2(23), 1\u20135 (1963)"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/2206869.2206879","volume":"41","author":"PT Wood","year":"2012","unstructured":"Wood, P.T.: Query languages for graph databases. SIGMOD Rec. 41(1), 50\u201360 (2012). \nhttps:\/\/doi.org\/10.1145\/2206869.2206879","journal-title":"SIGMOD Rec."}],"container-title":["Lecture Notes in Computer Science","Graph Transformation, Specifications, and Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75396-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T21:36:29Z","timestamp":1517866589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-75396-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319753959","9783319753966"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75396-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}