{"id":"https://openalex.org/W4409775634","doi":"https://doi.org/10.46298/lmcs-21(2:8)2025","title":"A robust graph-based approach to observational equivalence","display_name":"A robust graph-based approach to observational equivalence","publication_year":2025,"publication_date":"2025-04-24","ids":{"openalex":"https://openalex.org/W4409775634","doi":"https://doi.org/10.46298/lmcs-21(2:8)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(2:8)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:8)2025","pdf_url":"https://lmcs.episciences.org/15564/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":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/15564/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072298249","display_name":"Dan R. Ghica","orcid":"https://orcid.org/0000-0002-4003-8893"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dan R. Ghica","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076471067","display_name":"Koko Muroya","orcid":"https://orcid.org/0000-0003-0454-6900"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Koko Muroya","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5024586535","display_name":"Todd Waugh Ambridge","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Todd Waugh Ambridge","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072298249"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08530724,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, 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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6252999901771545,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6252999901771545,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/observational-equivalence","display_name":"Observational equivalence","score":0.7432282567024231},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6047812700271606},{"id":"https://openalex.org/keywords/observational-study","display_name":"Observational study","score":0.5780194997787476},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5295064449310303},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4602552652359009},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4153749346733093},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34821105003356934},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.27298784255981445},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12001562118530273}],"concepts":[{"id":"https://openalex.org/C2777721189","wikidata":"https://www.wikidata.org/wiki/Q17121921","display_name":"Observational equivalence","level":2,"score":0.7432282567024231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6047812700271606},{"id":"https://openalex.org/C23131810","wikidata":"https://www.wikidata.org/wiki/Q818574","display_name":"Observational study","level":2,"score":0.5780194997787476},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5295064449310303},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4602552652359009},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4153749346733093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34821105003356934},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27298784255981445},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12001562118530273}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/lmcs-21(2:8)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:8)2025","pdf_url":"https://lmcs.episciences.org/15564/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:doaj.org/article:89dcef5bfd584cec965c8943e27ad066","is_oa":true,"landing_page_url":"https://doaj.org/article/89dcef5bfd584cec965c8943e27ad066","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 2 (2025)","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/d38412b0-5301-4d1f-8638-514d0634a245","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/d38412b0-5301-4d1f-8638-514d0634a245","pdf_url":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Ghica, D, Muroya, K & Waugh Ambridge, T 2025, 'A robust graph-based approach to observational equivalence', Logical Methods in Computer Science, vol. 21, no. 2, 8, pp. 8:1\u20138:95. https://doi.org/10.46298/lmcs-21(2:8)2025","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(2:8)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:8)2025","pdf_url":"https://lmcs.episciences.org/15564/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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409775634.pdf","grobid_xml":"https://content.openalex.org/works/W4409775634.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4381328000","https://openalex.org/W2109147503","https://openalex.org/W2103779230","https://openalex.org/W2911339178","https://openalex.org/W334096847","https://openalex.org/W1568197394","https://openalex.org/W4255700610","https://openalex.org/W2942168487","https://openalex.org/W3183205774","https://openalex.org/W1705007349"],"abstract_inverted_index":{"We":[0,128],"propose":[1],"a":[2,41,48,63,103],"new":[3],"step-wise":[4],"approach":[5,20],"to":[6],"proving":[7,62],"observational":[8,17,53,67],"equivalence,":[9],"and":[10,38,83,121],"in":[11,87],"particular":[12],"reasoning":[13,31],"about":[14],"fragility":[15],"of":[16,36,45,52,61,66,80,89,92,111,115],"equivalence.":[18,54,68],"Our":[19],"is":[21,59,100,123],"based":[22],"on":[23],"what":[24],"we":[25,98],"call":[26],"local":[27,30],"reasoning.":[28],"The":[29,69,95,113],"exploits":[32],"the":[33,90,134],"graphical":[34],"concept":[35,44],"neighbourhood,":[37],"it":[39],"extracts":[40],"new,":[42],"formal,":[43],"robustness":[46],"as":[47],"key":[49],"sufficient":[50],"condition":[51],"Moreover,":[55],"our":[56,130],"proof":[57,131],"methodology":[58,132],"capable":[60],"generalised":[64,70],"notion":[65,71],"can":[72],"be":[73],"quantified":[74],"over":[75],"syntactically":[76],"restricted":[77],"contexts":[78],"instead":[79],"all":[81],"contexts,":[82],"also":[84],"quantitatively":[85],"constrained":[86],"terms":[88],"number":[91],"reduction":[93],"steps.":[94],"operational":[96],"machinery":[97],"use":[99],"given":[101],"by":[102,108,125],"hypergraph-rewriting":[104,126],"abstract":[105],"machine":[106],"inspired":[107],"Girard's":[109],"Geometry":[110],"Interaction.":[112],"behaviour":[114],"language":[116],"features,":[117],"including":[118],"function":[119],"abstraction":[120],"application,":[122],"provided":[124],"rules.":[127],"demonstrate":[129],"using":[133],"call-by-value":[135],"lambda-calculus":[136],"equipped":[137],"with":[138],"(higher-order)":[139],"state.":[140]},"counts_by_year":[],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}