{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:26:24Z","timestamp":1648693584041},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":2158,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1016\/j.entcs.2002.09.008","type":"journal-article","created":{"date-parts":[[2007,8,31]],"date-time":"2007-08-31T11:14:59Z","timestamp":1188558899000},"page":"87-100","source":"Crossref","is-referenced-by-count":0,"title":["Conditional Term Graph Rewriting with Indirect Sharing"],"prefix":"10.1016","volume":"72","author":[{"given":"Enno","family":"Ohlebusch","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2002.09.008_bib001","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","article-title":"Equational term graph rewriting","volume":"26","author":"Ariola","year":"1996","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/j.entcs.2002.09.008_bib002","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/inco.1999.2824","article-title":"Bisimilarity in term graph rewriting","volume":"156","author":"Ariola","year":"2000","journal-title":"Information and Computation"},{"key":"10.1016\/j.entcs.2002.09.008_bib003","series-title":"Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning","first-page":"215","article-title":"On conditional rewrite systems with extra variables and deterministic logic programs","volume":"822","author":"Avenhaus","year":"1994"},{"key":"10.1016\/j.entcs.2002.09.008_bib004","series-title":"Proceedings of Parallel Architectures and Languages Europe","first-page":"141","article-title":"Term graph rewriting","volume":"259","author":"Barendregt","year":"1987"},{"key":"10.1016\/j.entcs.2002.09.008_bib005","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","article-title":"Conditional rewrite rules: Confluence and termination","volume":"32","author":"Bergstra","year":"1986","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.entcs.2002.09.008_bib006","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(90)90064-O","article-title":"A rationale for conditional equational programming","volume":"75","author":"Dershowitz","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2002.09.008_bib007","series-title":"Proceedings of the 9th Conference on Automated Deduction","first-page":"538","article-title":"Canonical conditional rewrite systems","volume":"310","author":"Dershowitz","year":"1988"},{"key":"10.1016\/j.entcs.2002.09.008_bib008","series-title":"Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems","first-page":"113","article-title":"Termination proofs of well-moded logic programs via conditional rewrite systems","volume":"656","author":"Ganzinger","year":"1993"},{"key":"10.1016\/j.entcs.2002.09.008_bib009","unstructured":"Hanus, M., On extra variables in (equational) logic programming, in: Proceedings of the 12th International Conference on Logic Programming (1995), pp. 665\u2013679"},{"key":"10.1016\/j.entcs.2002.09.008_bib010","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/177492.177577","article-title":"On the adequacy of term graph rewriting for simulating term rewriting","volume":"16","author":"Kennaway","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/j.entcs.2002.09.008_bib011","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(94)00248-3","article-title":"Modularity in noncopying term rewriting","volume":"152","author":"Kurihara","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2002.09.008_bib012","series-title":"Proceedings of the 5th International Conference on Algebraic and Logic Programming","first-page":"107","article-title":"Unravelings and ultra-properties","volume":"1139","author":"Marchiori","year":"1996"},{"key":"10.1016\/j.entcs.2002.09.008_bib013","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01190830","article-title":"Completeness results for basic narrowing","volume":"5","author":"Middeldorp","year":"1994","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"10.1016\/j.entcs.2002.09.008_bib014","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0190(99)00150-7","article-title":"A uniform framework for term and graph rewriting applied to combined systems","volume":"73","author":"Ohlebusch","year":"2000","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.entcs.2002.09.008_bib015","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0304-3975(00)00209-7","article-title":"Implementing conditional term rewriting by graph rewriting","volume":"262","author":"Ohlebusch","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2002.09.008_bib016","series-title":"Advanced Topics in Term Rewriting","author":"Ohlebusch","year":"2002"},{"key":"10.1016\/j.entcs.2002.09.008_bib017","first-page":"3","article-title":"Term graph rewriting","volume":"vol. 2","author":"Plump","year":"1999"},{"key":"10.1016\/j.entcs.2002.09.008_bib018","series-title":"Term Graph Rewriting","year":"1993"},{"key":"10.1016\/j.entcs.2002.09.008_bib019","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(80)90013-4","article-title":"Computation on graph-like expressions","volume":"10","author":"Staples","year":"1980","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2002.09.008_bib020","series-title":"Proceedings of the 6th International Conference on Rewriting Techniques and Applications","first-page":"179","article-title":"Level-confluence of conditional rewrite systems with extra variables in right-hand sides","volume":"914","author":"Suzuki","year":"1995"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571066107005531?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571066107005531?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T06:56:37Z","timestamp":1587884197000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066107005531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["S1571066107005531"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.entcs.2002.09.008","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}