{"id":"https://openalex.org/W3173471069","doi":"https://doi.org/10.1109/lics52264.2021.9470594","title":"Comonadic semantics for guarded fragments","display_name":"Comonadic semantics for guarded fragments","publication_year":2021,"publication_date":"2021-06-29","ids":{"openalex":"https://openalex.org/W3173471069","doi":"https://doi.org/10.1109/lics52264.2021.9470594","mag":"3173471069"},"language":"en","primary_location":{"id":"doi:10.1109/lics52264.2021.9470594","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470594","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th 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://nottingham-repository.worktribe.com/output/40556979","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081687891","display_name":"Samson Abramsky","orcid":"https://orcid.org/0000-0003-3921-6637"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Samson Abramsky","raw_affiliation_strings":["University of Oxford"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109391931","display_name":"Dan Marsden","orcid":"https://orcid.org/0000-0003-0579-0323"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Dan Marsden","raw_affiliation_strings":["University of Oxford"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"13"},"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.9973000288009644,"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.9973000288009644,"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.9955000281333923,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9898999929428101,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.7774221897125244},{"id":"https://openalex.org/keywords/morphism","display_name":"Morphism","score":0.6948458552360535},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.6527467370033264},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4577059745788574},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42468273639678955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4154800772666931},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37176966667175293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3587610125541687},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2986034154891968},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21041324734687805}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.7774221897125244},{"id":"https://openalex.org/C137212723","wikidata":"https://www.wikidata.org/wiki/Q1948412","display_name":"Morphism","level":2,"score":0.6948458552360535},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.6527467370033264},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4577059745788574},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42468273639678955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4154800772666931},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37176966667175293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3587610125541687},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2986034154891968},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21041324734687805}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics52264.2021.9470594","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics52264.2021.9470594","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:nottingham-repository.worktribe.com:40556979","is_oa":true,"landing_page_url":"https://nottingham-repository.worktribe.com/output/40556979","pdf_url":null,"source":{"id":"https://openalex.org/S4306402483","display_name":"Repository@Nottingham (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"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":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:nottingham-repository.worktribe.com:40556979","is_oa":true,"landing_page_url":"https://nottingham-repository.worktribe.com/output/40556979","pdf_url":null,"source":{"id":"https://openalex.org/S4306402483","display_name":"Repository@Nottingham (University of Nottingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I142263535","host_organization_name":"University of Nottingham","host_organization_lineage":["https://openalex.org/I142263535"],"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":null,"raw_type":"Presentation / Conference Contribution"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4699999988079071}],"awards":[{"id":"https://openalex.org/G2892483683","display_name":null,"funder_award_id":"EP/T00696X/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4627987206","display_name":null,"funder_award_id":"EP/T00696X/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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W117467870","https://openalex.org/W129686139","https://openalex.org/W1533008268","https://openalex.org/W1538382614","https://openalex.org/W1566071135","https://openalex.org/W1929404437","https://openalex.org/W1991981864","https://openalex.org/W2044280967","https://openalex.org/W2105441172","https://openalex.org/W2113800199","https://openalex.org/W2131153448","https://openalex.org/W2138773009","https://openalex.org/W2165966638","https://openalex.org/W2179506702","https://openalex.org/W2613837134","https://openalex.org/W2752032329","https://openalex.org/W2809801964","https://openalex.org/W2810685260","https://openalex.org/W2913966000","https://openalex.org/W2952430021","https://openalex.org/W2963661828","https://openalex.org/W3121856175","https://openalex.org/W3192733234","https://openalex.org/W4232277105","https://openalex.org/W4285719527","https://openalex.org/W4300454881","https://openalex.org/W4306175326","https://openalex.org/W6632326162","https://openalex.org/W6680562843","https://openalex.org/W6743442855","https://openalex.org/W6752453763"],"related_works":["https://openalex.org/W1495872178","https://openalex.org/W1522712643","https://openalex.org/W1973480752","https://openalex.org/W2102135785","https://openalex.org/W2136070637","https://openalex.org/W2089212807","https://openalex.org/W2783071694","https://openalex.org/W2805502594","https://openalex.org/W3096633875","https://openalex.org/W2124122503"],"abstract_inverted_index":{"In":[0,83],"previous":[1],"work":[2],"([1],":[3],"[2],":[4],"[3]),":[5],"it":[6],"has":[7],"been":[8],"shown":[9],"how":[10],"a":[11,19,74,141,145],"range":[12],"of":[13,37,43,69,117,150],"model":[14,24],"comparison":[15],"games":[16],"which":[17],"play":[18],"central":[20],"role":[21],"in":[22,35,96,108],"finite":[23],"theory,":[25],"including":[26],"Ehrenfeucht-Fra\u00efss\u00e9,":[27],"pebbling,":[28],"and":[29,59,80,105,127],"bisimulation":[30,100],"games,":[31],"can":[32],"be":[33],"captured":[34,114],"terms":[36],"resource-indexed":[38],"comonads":[39,51],"on":[40,147],"the":[41,47,97,109,122,148],"category":[42,149],"relational":[44],"structures.":[45],"Moreover,":[46],"coalgebras":[48,123],"for":[49,94,124],"these":[50,125,138],"capture":[52,91],"important":[53],"combinatorial":[54],"parameters":[55],"such":[56],"as":[57],"tree-width":[58],"tree-depth.The":[60],"present":[61],"paper":[62],"extends":[63],"this":[64],"analysis":[65],"to":[66,132,140],"quantifier-guarded":[67],"fragments":[68],"first-order":[70],"logic.":[71],"We":[72,120,136],"give":[73],"systematic":[75],"account,":[76],"covering":[77],"atomic,":[78],"loose":[79],"clique":[81],"guards.":[82],"each":[84],"case,":[85],"we":[86],"show":[87,128],"that":[88,129],"coKleisli":[89],"morphisms":[90],"winning":[92],"strategies":[93],"Duplicator":[95],"existential":[98],"guarded":[99,111,133],"game,":[101],"while":[102],"back-and-forth":[103],"bisimulation,":[104],"hence":[106],"equivalence":[107],"full":[110],"fragment,":[112],"is":[113],"by":[115],"spans":[116],"open":[118],"morphisms.":[119],"study":[121],"comonads,":[126],"they":[130],"correspond":[131],"tree":[134],"decompositions.":[135],"relate":[137],"constructions":[139],"syntax-free":[142],"setting,":[143],"with":[144],"comonad":[146],"hypergraphs.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}