{"id":"https://openalex.org/W4417168964","doi":"https://doi.org/10.4230/lipics.icalp.2025.172","title":"Weighted GKAT: Completeness and Complexity","display_name":"Weighted GKAT: Completeness and Complexity","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4417168964","doi":"https://doi.org/10.4230/lipics.icalp.2025.172"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2504.20385","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.20385","pdf_url":"https://arxiv.org/pdf/2504.20385","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2504.20385","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120734405","display_name":"Spencer Van Koevering","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Van Koevering, Spencer","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023706822","display_name":"Wojciech R\u00f3\u017cowski","orcid":"https://orcid.org/0000-0002-8241-7277"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"R\u00f3\u017cowski, Wojciech","raw_affiliation_strings":["University College London, UK"],"affiliations":[{"raw_affiliation_string":"University College London, UK","institution_ids":["https://openalex.org/I45129253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100658822","display_name":"Alexandra Silva","orcid":"https://orcid.org/0000-0001-5014-9784"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Silva, Alexandra","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA"],"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5120734405"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40186169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.6406999826431274,"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/T10142","display_name":"Formal Methods in Verification","score":0.6406999826431274,"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.21279999613761902,"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.06239999830722809,"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/completeness","display_name":"Completeness (order theory)","score":0.6100000143051147},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.6078000068664551},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5957000255584717},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5674999952316284},{"id":"https://openalex.org/keywords/kleene-algebra","display_name":"Kleene algebra","score":0.5266000032424927},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4526999890804291},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44780001044273376},{"id":"https://openalex.org/keywords/kleenes-recursion-theorem","display_name":"Kleene's recursion theorem","score":0.36719998717308044},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.362199991941452}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6100000143051147},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.6078000068664551},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5957000255584717},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5674999952316284},{"id":"https://openalex.org/C206470798","wikidata":"https://www.wikidata.org/wiki/Q2634506","display_name":"Kleene algebra","level":2,"score":0.5266000032424927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.476500004529953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4650999903678894},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4526999890804291},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44780001044273376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4440999925136566},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43140000104904175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43070000410079956},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.392300009727478},{"id":"https://openalex.org/C123260079","wikidata":"https://www.wikidata.org/wiki/Q1933521","display_name":"Kleene's recursion theorem","level":2,"score":0.36719998717308044},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.362199991941452},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.3578999936580658},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3280999958515167},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.30169999599456787},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.2971000075340271},{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.2890999913215637},{"id":"https://openalex.org/C146072743","wikidata":"https://www.wikidata.org/wiki/Q192161","display_name":"Formal language","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C146499914","wikidata":"https://www.wikidata.org/wiki/Q5469969","display_name":"Formal semantics (linguistics)","level":2,"score":0.26759999990463257},{"id":"https://openalex.org/C2778249326","wikidata":"https://www.wikidata.org/wiki/Q1777803","display_name":"Coalgebra","level":3,"score":0.2655999958515167},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C200116569","wikidata":"https://www.wikidata.org/wiki/Q902052","display_name":"G\u00f6del's completeness theorem","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2504.20385","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.20385","pdf_url":"https://arxiv.org/pdf/2504.20385","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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:drops-oai.dagstuhl.de:23549","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.172","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.172/LIPIcs.ICALP.2025.172.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},{"id":"doi:10.48550/arxiv.2504.20385","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.20385","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.icalp.2025.172","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2025.172","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2504.20385","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.20385","pdf_url":"https://arxiv.org/pdf/2504.20385","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,20,40],"propose":[1],"Weighted":[2],"Guarded":[3],"Kleene":[4],"Algebra":[5],"with":[6,15],"Tests":[7],"(wGKAT),":[8],"an":[9,22],"uninterpreted":[10],"weighted":[11,31],"programming":[12],"language":[13],"equipped":[14],"branching,":[16],"conditionals,":[17],"and":[18,33,37],"loops.":[19],"provide":[21,42],"operational":[23],"semantics":[24],"for":[25,48],"wGKAT":[26],"using":[27],"a":[28,35,43],"variant":[29],"of":[30],"automata":[32],"introduce":[34],"sound":[36],"complete":[38],"axiomatization.":[39],"also":[41],"polynomial":[44],"time":[45],"decision":[46],"procedure":[47],"bisimulation":[49],"equivalence.":[50]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}