{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:13Z","timestamp":1759637773947},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642159275"},{"type":"electronic","value":"9783642159282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15928-2_22","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T14:32:34Z","timestamp":1284993154000},"page":"330-345","source":"Crossref","is-referenced-by-count":6,"title":["Local Confluence for Rules with Nested Application Conditions"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Ehrig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annegret","family":"Habel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leen","family":"Lambers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Orejas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrike","family":"Golas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"22_CR2","volume-title":"EATCS Monographs of Theoretical Computer Science","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. In: EATCS Monographs of Theoretical Computer Science. Springer, Heidelberg (2006)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Knuth, N.E., Bendix, P.B.: Simple word problems in universal algebra. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297 (1970)","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"22_CR4","first-page":"201","volume-title":"Term Graph Rewriting: Theory and Practice","author":"D. Plump","year":"1993","unstructured":"Plump, D.: Hypergraph rewriting: Critical pairs and undecidability of confluence. In: Term Graph Rewriting: Theory and Practice, pp. 201\u2013213. John Wiley, Chichester (1993)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11601548_16","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"D. Plump","year":"2005","unstructured":"Plump, D.: Confluence of graph transformation revisited. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 280\u2013308. Springer, Heidelberg (2005)"},{"key":"22_CR6","doi-asserted-by":"crossref","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\u00a026, 287\u2013313 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-87405-8_12","volume-title":"Graph Transformations","author":"L. Lambers","year":"2008","unstructured":"Lambers, L., Ehrig, H., Prange, U., Orejas, F.: Embedding and confluence of graph transformations with negative application conditions. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 162\u2013177. Springer, Heidelberg (2008)"},{"key":"22_CR8","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. Mathematical Structures in Computer Science\u00a019, 245\u2013296 (2009)","journal-title":"Mathematical Structures in Computer Science"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1142\/9789812384720_0005","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"B. Courcelle","year":"1997","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01, pp. 313\u2013400. World Scientific, Singapore (1997)"},{"key":"22_CR10","unstructured":"Lambers, L., Ehrig, H., Habel, A., Orejas, F., Golas, U.: Local Confluence for Rules with Nested Application Conditions based on a New Critical Pair Notion. Technical Report 2010-7, Technische Universit\u00e4t Berlin (2010)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24727-2_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Lack","year":"2004","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 273\u2013288. Springer, Heidelberg (2004)"},{"issue":"2","key":"22_CR12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"Newman, M.H.A.: On theories with a combinatorial definition of \u201cequivalence\u201d. Annals of Mathematics\u00a0(43,2), 223\u2013243 (1942)","journal-title":"Annals of Mathematics"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2004.11.002","volume":"71","author":"M. Koch","year":"2005","unstructured":"Koch, M., Mancini, L.V., Parisi-Presicce, F.: Graph-based specification of access control policies. Journal of Computer and System Sciences\u00a071, 1\u201333 (2005)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"22_CR14","first-page":"135","volume":"74","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.H.: Theory of constraints and application conditions: From graphs to high-level structures. Fundamenta Informaticae\u00a074(1), 135\u2013166 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR15","unstructured":"Ehrig, H., Habel, A., Lambers, L.: Parallelism and concurrency theorems for rules with nested application conditions. In: Essays Dedicated to Hans-J\u00f6rg Kreowski on the Occasion of His 60th Birthday. Electronic Communications of the EASST, vol.\u00a026 (2010)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-78743-3_14","volume-title":"Fundamental Approaches to Software Engineering","author":"F. Orejas","year":"2008","unstructured":"Orejas, F., Ehrig, H., Prange, U.: A logic of graph constraints. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol.\u00a04961, pp. 179\u2013198. Springer, Heidelberg (2008)"},{"key":"22_CR17","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.\u00a05214, pp. 289\u2013304. Springer, Heidelberg (2008)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Pennemann, K.H.: An algorithm for approximating the satisfiability problem of high-level conditions. In: Proc. Int. Workshop on Graph Transformation for Verification and Concurrency (GT-VC 2007). ENTCS, vol.\u00a0213, pp. 75\u201394 (2008), http:\/\/formale-sprachen.informatik.uni-oldenburg.de\/pub\/index.html","DOI":"10.1016\/j.entcs.2008.04.075"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11841883_6","volume-title":"Graph Transformations","author":"L. Lambers","year":"2006","unstructured":"Lambers, L., Ehrig, H., Orejas, F.: Conflict detection for graph transformation with negative application conditions. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 61\u201376. Springer, Heidelberg (2006)"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 by graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol.\u00a03256, pp. 319\u2013335. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15928-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:20:10Z","timestamp":1619785210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15928-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159275","9783642159282"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15928-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}