{"id":"https://openalex.org/W2764235762","doi":"https://doi.org/10.2168/lmcs-8(2:6)2012","title":"Modes of Convergence for Term Graph Rewriting","display_name":"Modes of Convergence for Term Graph Rewriting","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2764235762","doi":"https://doi.org/10.2168/lmcs-8(2:6)2012","mag":"2764235762"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(2:6)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(2:6)2012","pdf_url":"https://lmcs.episciences.org/935/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/935/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015853763","display_name":"Patrick Bahr","orcid":"https://orcid.org/0000-0003-1600-8261"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Patrick Bahr","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen (DIKU) Universitetsparken 1, 2100 Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-1600-8261","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen (DIKU) Universitetsparken 1, 2100 Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015853763"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":null,"apc_paid":null,"fwci":1.3265,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.85485481,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"Volume 8, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.9138240814208984},{"id":"https://openalex.org/keywords/conservative-extension","display_name":"Conservative extension","score":0.7093570232391357},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.7038375735282898},{"id":"https://openalex.org/keywords/graph-rewriting","display_name":"Graph rewriting","score":0.6822595596313477},{"id":"https://openalex.org/keywords/confluence","display_name":"Confluence","score":0.6728361248970032},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47478076815605164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4666481018066406},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3876959979534149},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28643855452537537},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08201637864112854}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.9138240814208984},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.7093570232391357},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.7038375735282898},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.6822595596313477},{"id":"https://openalex.org/C77906462","wikidata":"https://www.wikidata.org/wiki/Q1140902","display_name":"Confluence","level":2,"score":0.6728361248970032},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47478076815605164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4666481018066406},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3876959979534149},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28643855452537537},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08201637864112854},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.2168/lmcs-8(2:6)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(2:6)2012","pdf_url":"https://lmcs.episciences.org/935/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1205.0357","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1205.0357","pdf_url":"https://arxiv.org/pdf/1205.0357","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/be42b2a9-6527-40fb-8f81-a98586e84b40","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/be42b2a9-6527-40fb-8f81-a98586e84b40","pdf_url":"https://curis.ku.dk/ws/files/38429537/bahr12lmcs_paper.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bahr , P 2012 , ' Modes of convergence for term graph rewriting ' , Logical Methods in Computer Science , vol. 8 , no. 2 , 6 . https://doi.org/10.2168/LMCS-8(2:6)2012","raw_type":"article"},{"id":"pmh:oai:doaj.org/article:ca676bdad13b46a0958f6cb268cedf7e","is_oa":true,"landing_page_url":"https://doaj.org/article/ca676bdad13b46a0958f6cb268cedf7e","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 2 (2012)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/be42b2a9-6527-40fb-8f81-a98586e84b40","is_oa":true,"landing_page_url":"https://curis.ku.dk/portal/da/publications/modes-of-convergence-for-term-graph-rewriting(be42b2a9-6527-40fb-8f81-a98586e84b40).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.atira.dk:publications/82d1ce2a-bec4-4c94-b94a-44935998e90b","is_oa":false,"landing_page_url":"http://www.lmcs-online.org/ojs/viewarticle.php?id=1097","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bahr, P 2012, 'Modes of Convergence for Term Graph Rewriting', Logical Methods in Computer Science, bind 8, nr. 2. https://doi.org/10.2168/LMCS-8(2:6)2012","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(2:6)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(2:6)2012","pdf_url":"https://lmcs.episciences.org/935/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2764235762.pdf","grobid_xml":"https://content.openalex.org/works/W2764235762.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W598205067","https://openalex.org/W1485410855","https://openalex.org/W1499407070","https://openalex.org/W1505989459","https://openalex.org/W1520096901","https://openalex.org/W1543641760","https://openalex.org/W1557619244","https://openalex.org/W1564071846","https://openalex.org/W1606493103","https://openalex.org/W1968168625","https://openalex.org/W2006468185","https://openalex.org/W2012961833","https://openalex.org/W2025108869","https://openalex.org/W2061786858","https://openalex.org/W2067911767","https://openalex.org/W2077004427","https://openalex.org/W2084072743","https://openalex.org/W2084745607","https://openalex.org/W2088482003","https://openalex.org/W2089241138","https://openalex.org/W2095451697","https://openalex.org/W2134880869","https://openalex.org/W2152494158","https://openalex.org/W2154286698","https://openalex.org/W2157334321","https://openalex.org/W2168040866","https://openalex.org/W2911979341","https://openalex.org/W3101344398","https://openalex.org/W4251084952"],"related_works":["https://openalex.org/W2463026518","https://openalex.org/W1761458962","https://openalex.org/W2504157767","https://openalex.org/W1515515243","https://openalex.org/W4206221271","https://openalex.org/W3172487478","https://openalex.org/W2475418661","https://openalex.org/W1504820687","https://openalex.org/W2491573813","https://openalex.org/W2154047167"],"abstract_inverted_index":{"Term":[0],"graph":[1,24,108],"rewriting":[2,21,25,46,105,109,172],"provides":[3],"a":[4,67,71,98,195],"simple":[5],"mechanism":[6],"to":[7,29,55,115,158],"finitely":[8],"represent":[9],"restricted":[10],"forms":[11],"of":[12,40,44,50,63,83,135,143,147,165,180,183,198],"infinitary":[13,19,45,90,170],"term":[14,20,23,51,74,91,104,107,123,138,156,171],"rewriting.":[15,92],"The":[16,76],"correspondence":[17],"between":[18],"and":[22,106,125,151,185],"has":[26],"been":[27],"studied":[28,88],"some":[30],"extent.":[31],"However,":[32],"this":[33,57,96],"endeavour":[34],"is":[35,194],"impaired":[36],"by":[37,59],"the":[38,48,133,144,166,177,186,191,199],"lack":[39],"an":[41],"appropriate":[42],"counterpart":[43],"on":[47,66,73,122,126,137,149],"side":[49],"graphs.":[52,75],"We":[53,93],"aim":[54],"fill":[56],"gap":[58],"devising":[60],"two":[61],"modes":[62,82,134,146,182],"convergence":[64,84,121,136,148,184,189],"based":[65],"partial":[68,192],"order":[69,114,193],"respectively":[70],"metric":[72,200],"thus":[77],"obtained":[78],"structures":[79],"generalise":[80],"corresponding":[81,145],"that":[85,95,132,163,188],"are":[86,140,152,173],"usually":[87],"in":[89,101],"argue":[94],"yields":[97],"common":[99],"framework":[100],"which":[102],"both":[103,181],"can":[110],"be":[111],"studied.":[112],"In":[113,128],"substantiate":[116],"our":[117],"claim,":[118],"we":[119,130,161],"compare":[120],"graphs":[124,139,157],"terms.":[127,159],"particular,":[129],"show":[131,162],"conservative":[141,196],"extensions":[142],"terms":[150],"preserved":[153],"under":[154],"unravelling":[155],"Moreover,":[160],"many":[164],"properties":[167],"known":[168],"from":[169],"preserved.":[174],"This":[175],"includes":[176],"intrinsic":[178],"completeness":[179],"fact":[187],"via":[190],"extension":[197],"convergence.":[201]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2020-11-23T00:00:00"}