{"id":"https://openalex.org/W4415003879","doi":"https://doi.org/10.1109/lics65433.2025.00023","title":"Equivalence Hypergraphs: DPO Rewriting for Monoidal E-Graphs","display_name":"Equivalence Hypergraphs: DPO Rewriting for Monoidal E-Graphs","publication_year":2025,"publication_date":"2025-06-23","ids":{"openalex":"https://openalex.org/W4415003879","doi":"https://doi.org/10.1109/lics65433.2025.00023"},"language":"en","primary_location":{"id":"doi:10.1109/lics65433.2025.00023","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics65433.2025.00023","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure-oai.bham.ac.uk/ws/files/284979324/Monoidal_EGraphs_CameraReady.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5099496945","display_name":"Aleksei Tiurin","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Aleksei Tiurin","raw_affiliation_strings":["University of Birmingham,United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham,United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101791984","display_name":"Chris Barrett","orcid":"https://orcid.org/0000-0003-1708-3554"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Chris Barrett","raw_affiliation_strings":["University of Birmingham,United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham,United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072298249","display_name":"Dan R. Ghica","orcid":"https://orcid.org/0000-0002-4003-8893"},"institutions":[{"id":"https://openalex.org/I4210160618","display_name":"Huawei Technologies (United Kingdom)","ror":"https://ror.org/056gzgs71","country_code":"GB","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210160618"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dan R. Ghica","raw_affiliation_strings":["Huawei Central Software Institute and University of Birmingham,United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Huawei Central Software Institute and University of Birmingham,United Kingdom","institution_ids":["https://openalex.org/I4210160618"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5119823550","display_name":"Nick Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nick Hu","raw_affiliation_strings":["University of Birmingham,United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Birmingham,United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33604888,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"209","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11567","display_name":"semigroups and automata theory","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9843000173568726,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9660999774932861,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/morphism","display_name":"Morphism","score":0.6850000023841858},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.6743999719619751},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5907999873161316},{"id":"https://openalex.org/keywords/monoidal-category","display_name":"Monoidal category","score":0.5771999955177307},{"id":"https://openalex.org/keywords/categorical-variable","display_name":"Categorical variable","score":0.4991999864578247},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4668000042438507},{"id":"https://openalex.org/keywords/symmetric-monoidal-category","display_name":"Symmetric monoidal category","score":0.4587000012397766},{"id":"https://openalex.org/keywords/cartesian-closed-category","display_name":"Cartesian closed category","score":0.42879998683929443}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6887999773025513},{"id":"https://openalex.org/C137212723","wikidata":"https://www.wikidata.org/wiki/Q1948412","display_name":"Morphism","level":2,"score":0.6850000023841858},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.6743999719619751},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5907999873161316},{"id":"https://openalex.org/C2779904274","wikidata":"https://www.wikidata.org/wiki/Q1945014","display_name":"Monoidal category","level":2,"score":0.5771999955177307},{"id":"https://openalex.org/C5274069","wikidata":"https://www.wikidata.org/wiki/Q2285707","display_name":"Categorical variable","level":2,"score":0.4991999864578247},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4668000042438507},{"id":"https://openalex.org/C98912367","wikidata":"https://www.wikidata.org/wiki/Q17103860","display_name":"Symmetric monoidal category","level":3,"score":0.4587000012397766},{"id":"https://openalex.org/C171032842","wikidata":"https://www.wikidata.org/wiki/Q1725874","display_name":"Cartesian closed category","level":2,"score":0.42879998683929443},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4146000146865845},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3928999900817871},{"id":"https://openalex.org/C182419690","wikidata":"https://www.wikidata.org/wiki/Q205464","display_name":"Algebraic structure","level":2,"score":0.3725999891757965},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.36550000309944153},{"id":"https://openalex.org/C54884031","wikidata":"https://www.wikidata.org/wiki/Q217413","display_name":"Category theory","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3337000012397766},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.3158999979496002},{"id":"https://openalex.org/C156772000","wikidata":"https://www.wikidata.org/wiki/Q864475","display_name":"Functor","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C156163052","wikidata":"https://www.wikidata.org/wiki/Q5379515","display_name":"Enriched category","level":3,"score":0.28299999237060547},{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C2779729104","wikidata":"https://www.wikidata.org/wiki/Q4724013","display_name":"Algebraic semantics","level":3,"score":0.25029999017715454}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics65433.2025.00023","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics65433.2025.00023","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/8e0fa428-e7fb-4d5a-bf61-3b2ad9dcbaea","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/8e0fa428-e7fb-4d5a-bf61-3b2ad9dcbaea","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/284979324/Monoidal_EGraphs_CameraReady.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tiurin, A, Barrett, C, Ghica, D R & Hu, N 2025, Equivalence Hypergraphs : DPO Rewriting for Monoidal E-Graphs. in 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)., 11186301, Annual Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers (IEEE), pp. 209-222, 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 23/06/25. https://doi.org/10.1109/LICS65433.2025.00023","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/8e0fa428-e7fb-4d5a-bf61-3b2ad9dcbaea","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/8e0fa428-e7fb-4d5a-bf61-3b2ad9dcbaea","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/284979324/Monoidal_EGraphs_CameraReady.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tiurin, A, Barrett, C, Ghica, D R & Hu, N 2025, Equivalence Hypergraphs : DPO Rewriting for Monoidal E-Graphs. in 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)., 11186301, Annual Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers (IEEE), pp. 209-222, 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 23/06/25. https://doi.org/10.1109/LICS65433.2025.00023","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G47589988","display_name":"Semantics-Directed Compiler Construction: From Formal Semantics to Certified Compilers","funder_award_id":"EP/Y010035/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5732839329","display_name":"Nominal String Diagrams","funder_award_id":"EP/V001612/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415003879.pdf","grobid_xml":"https://content.openalex.org/works/W4415003879.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"technique":[1],"of":[2,30,37,52,69,79,92,102,122],"equality":[3],"saturation,":[4],"which":[5,45,81,117],"equips":[6],"graphs":[7],"with":[8],"an":[9],"equivalence":[10],"relation,":[11],"has":[12],"proven":[13],"effective":[14],"for":[15,114],"program":[16],"optimisation.":[17],"We":[18],"give":[19],"a":[20,63,73,77,99],"categorical":[21],"semantics":[22],"to":[23,42,49,57,108],"these":[24,115],"structures,":[25,116],"called":[26],"e-graphs,":[27],"in":[28,71],"terms":[29],"Cartesian":[31],"categories":[32],"enriched":[33],"over":[34],"the":[35,47,87,119],"category":[36],"semilattices.":[38],"This":[39,104],"approach":[40,107],"generalises":[41],"monoidal":[43,58],"categories,":[44],"opens":[46],"door":[48],"new":[50,105],"applications":[51],"e-graph":[53],"techniques,":[54],"from":[55],"algebraic":[56],"theories.":[59],"Finally,":[60],"we":[61,82],"present":[62],"sound":[64],"and":[65],"complete":[66],"combinatorial":[67],"representation":[68],"morphisms":[70],"such":[72],"category,":[74],"based":[75],"on":[76],"generalisation":[78],"hypergraphs":[80],"call":[83],"e-hypergraphs.":[84],"They":[85],"have":[86],"usual":[88],"advantage":[89],"that":[90],"many":[91],"their":[93],"structural":[94],"equations":[95],"are":[96],"absorbed":[97],"into":[98],"general":[100],"notion":[101],"isomorphism.":[103],"principled":[106],"e-graphs":[109],"enables":[110],"double-pushout":[111],"(DPO)":[112],"rewriting":[113],"constitutes":[118],"main":[120],"contribution":[121],"this":[123],"paper.":[124]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}