{"id":"https://openalex.org/W4401925512","doi":"https://doi.org/10.46298/lmcs-20(3:16)2024","title":"On two-variable guarded fragment logic with expressive local Presburger constraints","display_name":"On two-variable guarded fragment logic with expressive local Presburger constraints","publication_year":2024,"publication_date":"2024-08-27","ids":{"openalex":"https://openalex.org/W4401925512","doi":"https://doi.org/10.46298/lmcs-20(3:16)2024"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-20(3:16)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(3:16)2024","pdf_url":"https://lmcs.episciences.org/14106/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/14106/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069796117","display_name":"Chia-Hsuan Lu","orcid":"https://orcid.org/0009-0008-5446-9150"},"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":true,"raw_author_name":"Chia-Hsuan Lu","raw_affiliation_strings":["Department of Computer Science, University of Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060686021","display_name":"Tony Tan","orcid":"https://orcid.org/0009-0005-8341-2004"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tony Tan","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069796117"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.368,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6334788,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"Volume 20, Issue 3","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.9794999957084656,"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.9794999957084656,"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/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9638000130653381,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.8519505262374878},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.7242602705955505},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5995503664016724},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5328391790390015},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.48988527059555054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4895978569984436},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4891548454761505},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4890044927597046},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45337411761283875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4494766592979431},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4400528073310852},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36041125655174255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3033868670463562},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.2837598919868469},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11887666583061218}],"concepts":[{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.8519505262374878},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.7242602705955505},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5995503664016724},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5328391790390015},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.48988527059555054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4895978569984436},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4891548454761505},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4890044927597046},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45337411761283875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4494766592979431},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4400528073310852},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36041125655174255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3033868670463562},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.2837598919868469},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11887666583061218},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-20(3:16)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(3:16)2024","pdf_url":"https://lmcs.episciences.org/14106/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:1832dc855dcc4b628f6f013c9dfdd5d7","is_oa":true,"landing_page_url":"https://doaj.org/article/1832dc855dcc4b628f6f013c9dfdd5d7","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 20, Issue 3 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-20(3:16)2024","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-20(3:16)2024","pdf_url":"https://lmcs.episciences.org/14106/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":[{"id":"https://openalex.org/F4320323900","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4401925512.pdf","grobid_xml":"https://content.openalex.org/works/W4401925512.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W187636597","https://openalex.org/W1483892218","https://openalex.org/W1503647529","https://openalex.org/W1607550340","https://openalex.org/W1608479762","https://openalex.org/W1640599491","https://openalex.org/W1991981864","https://openalex.org/W1993151238","https://openalex.org/W1997817571","https://openalex.org/W2059215363","https://openalex.org/W2103658959","https://openalex.org/W2124580444","https://openalex.org/W2189181601","https://openalex.org/W2294895589","https://openalex.org/W2747784335","https://openalex.org/W2964224456","https://openalex.org/W2975157560","https://openalex.org/W3033601567","https://openalex.org/W3089623425","https://openalex.org/W3146347964","https://openalex.org/W3176208469","https://openalex.org/W3182554853","https://openalex.org/W4244275182"],"related_works":["https://openalex.org/W3037419933","https://openalex.org/W2400855043","https://openalex.org/W3033601567","https://openalex.org/W4296306758","https://openalex.org/W3176904788","https://openalex.org/W4288632937","https://openalex.org/W3200370358","https://openalex.org/W2909742694","https://openalex.org/W21597398","https://openalex.org/W4298153058"],"abstract_inverted_index":{"We":[0,59],"consider":[1],"the":[2,5,31,42,62,71,77,83],"extension":[3],"of":[4,25,33,44],"two-variable":[6,79],"guarded":[7,80],"fragment":[8,81],"logic":[9,67],"with":[10,53],"local":[11],"Presburger":[12],"quantifiers.":[13],"These":[14],"are":[15],"quantifiers":[16],"that":[17,61],"can":[18],"express":[19],"properties":[20],"such":[21],"as":[22],"\"the":[23],"number":[24,32,43],"incoming":[26,45],"blue":[27],"edges":[28,36],"plus":[29],"twice":[30],"outgoing":[34],"red":[35],"is":[37,68,86],"at":[38],"most":[39],"three":[40],"times":[41],"green":[46],"edges\"":[47],"and":[48],"captures":[49],"various":[50],"description":[51],"logics":[52],"counting,":[54],"but":[55],"without":[56],"constant":[57],"symbols.":[58],"show":[60],"satisfiability":[63],"problem":[64],"for":[65,76],"this":[66],"EXP-complete.":[69],"While":[70],"lower":[72],"bound":[73,85],"already":[74],"holds":[75],"standard":[78],"logic,":[82],"upper":[84],"established":[87],"by":[88],"a":[89],"novel,":[90],"yet":[91],"simple":[92],"deterministic":[93],"graph-based":[94],"algorithm.":[95]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2024-08-28T00:00:00"}