{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T21:16:40Z","timestamp":1694639800083},"reference-count":45,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T00:00:00Z","timestamp":1279584000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2011,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Graph transformation systems (GTS) and constraint handling rules (CHR) are non-deterministic rule-based state transition systems. CHR is well known for its powerful confluence and program equivalence analyses, for which we provide the basis in this work to apply them to GTS. We give a sound and complete embedding of GTS in CHR, investigate confluence of an embedded GTS and provide a program equivalence analysis for GTS via the embedding. The results confirm the suitability of CHR-based program analyses for other formalisms embedded in CHR.<\/jats:p>","DOI":"10.1017\/s1471068410000438","type":"journal-article","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T09:35:41Z","timestamp":1279618541000},"page":"65-109","source":"Crossref","is-referenced-by-count":5,"title":["Analysing graph transformation systems through constraint handling rules"],"prefix":"10.1017","volume":"11","author":[{"given":"FRANK","family":"RAISER","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"THOM","family":"FR\u00dcHWIRTH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2010,7,20]]},"reference":[{"key":"S1471068410000438_ref41","unstructured":"Van Weert P. 2008. JCHR. URL: http:\/\/www.cs.kuleuven.be\/~petervw\/JCHR."},{"key":"S1471068410000438_ref40","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/11924661_2","volume-title":"APLAS '06: Proceedings of the Fourth Asian Symposium on Programming Languages and Systems","author":"Sulzmann","year":"2006"},{"key":"S1471068410000438_ref39","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068409990123"},{"key":"S1471068410000438_ref37","first-page":"91","article-title":"Strong joinability analysis for graph transformation systems in CHR","volume":"253","author":"Raiser","year":"2009","journal-title":"Electronic Notes in Theoretical Computer Science \u2013 Proceedings of the Fifth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2009)"},{"key":"S1471068410000438_ref34","first-page":"540","volume-title":"Twenty-fifth International Conference on Logic Programming, ICLP","author":"Raiser","year":"2009"},{"key":"S1471068410000438_ref33","first-page":"588","volume-title":"Principles and Practice of Constraint Programming, 14th International Conference, CP 2008","author":"Raiser","year":"2008"},{"key":"S1471068410000438_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-003-0128-3"},{"key":"S1471068410000438_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60618-1_68"},{"key":"S1471068410000438_ref26","volume-title":"Algebraische Graphersetzung: mathematische Modellierung und Konfluenz","author":"L\u00f6we","year":"1993"},{"key":"S1471068410000438_ref24","first-page":"51","volume-title":"CHR '08","author":"Lam","year":"2008"},{"key":"S1471068410000438_ref23","first-page":"17","volume-title":"CHR '06: Proc. 3rd Workshop on Constraint Handling Rules","author":"Lam","year":"2006"},{"key":"S1471068410000438_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322230"},{"key":"S1471068410000438_ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609886"},{"key":"S1471068410000438_ref18","first-page":"298","volume-title":"Selected Papers from the Joint ERCIM\/Compulog Net Workshop on New Trends in Constraints","author":"Fr\u00fchwirth","year":"2000"},{"key":"S1471068410000438_ref17","first-page":"151","volume-title":"Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004","author":"Ehrig","year":"2004"},{"key":"S1471068410000438_ref15","first-page":"224","volume-title":"Logic Programming, 23rd International Conference, ICLP 2007","author":"Duck","year":"2007"},{"key":"S1471068410000438_ref12","first-page":"38","volume-title":"Fifth Workshop on Graph Grammars and Their Application To Computer Science","author":"Blostein","year":"1995"},{"key":"S1471068410000438_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/11564751_13"},{"key":"S1471068410000438_ref9","first-page":"1500","article-title":"Constraint based methods for biological sequence analysis","volume":"12","author":"Bavarian","year":"2006","journal-title":"Journal of Universal Computer Science"},{"key":"S1471068410000438_ref8","unstructured":"Barranco-Mendoza A. 2005. Stochastic and Heuristic Modelling for Analysis of the Growth of Pre-Invasive Lesions and for a Multidisciplinary Approach to Early Cancer Diagnosis. PhD thesis, Simon Fraser University, Burnaby, Canada."},{"key":"S1471068410000438_ref14","first-page":"117","volume-title":"ICLP '06","author":"Duck","year":"2006"},{"key":"S1471068410000438_ref7","first-page":"30","volume-title":"Applications of Graph Transformations with Industrial Relevance, Second International Workshop, AGTIVE 2003, Revised Selected and Invited Papers","author":"Bakewell","year":"2003"},{"key":"S1471068410000438_ref45","unstructured":"Wasserthal M. 2009. An Extensible Platform for the Analysis of Graph Transformation Systems using Constraint Handling Rules. Diploma thesis, Ulm University, Ulm, Germany."},{"key":"S1471068410000438_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752"},{"key":"S1471068410000438_ref44","volume-title":"A New Approach to Termination Analysis of CHR","author":"Voets","year":"2008"},{"key":"S1471068410000438_ref28","first-page":"501","volume-title":"ICLP '08","author":"Pilozzi","year":"2008"},{"key":"S1471068410000438_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90068-5"},{"key":"S1471068410000438_ref5","first-page":"106","volume-title":"Logic-Based Program Synthesis and Transformation, 17th International Symposium, LOPSTR 2007, Kongens Lyngby, Denmark, August 23-24, 2007, Revised Selected Papers","author":"Abdennadher","year":"2007"},{"key":"S1471068410000438_ref36","first-page":"49","volume-title":"Sixth International Workshop on Constraint Handling Rules (CHR)","author":"Raiser","year":"2009"},{"key":"S1471068410000438_ref30","first-page":"280","volume-title":"Processes, Terms and Cycles","author":"Plump","year":"2005"},{"key":"S1471068410000438_ref38","first-page":"242","volume-title":"Proceedings of ICGT '08 (International Conference on Graph Transformation)","author":"Rangel","year":"2008"},{"key":"S1471068410000438_ref16","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"Ehrig","year":"2006"},{"key":"S1471068410000438_ref19","first-page":"113","volume-title":"Logic Programming, 21st International Conference, ICLP 2005","author":"Fr\u00fchwirth","year":"2005"},{"key":"S1471068410000438_ref42","first-page":"59","volume-title":"LOPSTR '07, Revised Selected Papers","author":"Van Weert","year":"2008"},{"key":"S1471068410000438_ref10","first-page":"33","volume-title":"CHR '07","author":"Betz","year":"2007"},{"key":"S1471068410000438_ref43","first-page":"125","volume-title":"CHR '06","author":"Van Weert","year":"2006"},{"key":"S1471068410000438_ref27","doi-asserted-by":"publisher","DOI":"10.2307\/1968867"},{"key":"S1471068410000438_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-46464-8_15"},{"key":"S1471068410000438_ref35","first-page":"34","volume-title":"Sixth International Workshop on Constraint Handling Rules (CHR)","author":"Raiser","year":"2009"},{"key":"S1471068410000438_ref13","first-page":"346","volume-title":"IWINAC '09: Proceedings of the Third International Work-Conference on the Interplay Between Natural and Artificial Computation","author":"Dahl","year":"2009"},{"key":"S1471068410000438_ref4","first-page":"311","volume-title":"Special Issue on Constraint Handling Rules","author":"Abdennadher","year":"2000"},{"key":"S1471068410000438_ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009842826135"},{"key":"S1471068410000438_ref32","first-page":"240","volume-title":"Logic Programming, 23rd International Conference, ICLP 2007","author":"Raiser","year":"2007"},{"key":"S1471068410000438_ref2","first-page":"198","volume-title":"Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25\u201327, 2003, Revised Selected Papers","author":"Abdennadher","year":"2003"},{"key":"S1471068410000438_ref1","first-page":"43","volume-title":"Principles and Practice of Constraint Programming, CP 1999","author":"Abdennadher","year":"1999"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068410000438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T21:59:16Z","timestamp":1635717556000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068410000438\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,20]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["S1471068410000438"],"URL":"https:\/\/doi.org\/10.1017\/s1471068410000438","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,20]]}}}