{"id":"https://openalex.org/W3105690555","doi":"https://doi.org/10.23638/lmcs-15(3:31)2019","title":"The parameterized space complexity of model-checking bounded variable first-order logic","display_name":"The parameterized space complexity of model-checking bounded variable first-order logic","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W3105690555","doi":"https://doi.org/10.23638/lmcs-15(3:31)2019","mag":"3105690555"},"language":"en","primary_location":{"id":"pmh:oai:upcommons.upc.edu:2117/176983","is_oa":true,"landing_page_url":"https://hdl.handle.net/2117/176983","pdf_url":null,"source":{"id":"https://openalex.org/S4377196262","display_name":"UPCommons institutional repository (Universitat Polit\u00e8cnica de Catalunya)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9617848","host_organization_name":"Universitat Polit\u00e8cnica de Catalunya","host_organization_lineage":["https://openalex.org/I9617848"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/2117/176983","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032709994","display_name":"Yijia Chen","orcid":"https://orcid.org/0000-0002-9295-5028"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]},{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["CN","ES"],"is_corresponding":false,"raw_author_name":"Chen, Yijia","raw_affiliation_strings":["School of Computer Science, Fudan University, China","Department of Computer Science, Universitat Polit\u00e8cnica de Catalunya, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Fudan University, China","institution_ids":["https://openalex.org/I24943067"]},{"raw_affiliation_string":"Department of Computer Science, Universitat Polit\u00e8cnica de Catalunya, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031690987","display_name":"Michael Elberfeld","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Elberfeld, Michael","raw_affiliation_strings":["Lehrstuhl f\u00fcr Informatik 7, RWTH Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl f\u00fcr Informatik 7, RWTH Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011254078","display_name":"Moritz M\u00fcller","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Muller, Moritz Martin","raw_affiliation_strings":["CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"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.27192301,"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.9995999932289124,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/T11567","display_name":"semigroups and automata theory","score":0.9944999814033508,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8113626837730408},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6014175415039062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5329863429069519},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5312974452972412},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.4816626310348511},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.45247355103492737},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.41834622621536255},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.41402655839920044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4096250534057617},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3934439718723297},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3861224055290222},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3438568711280823},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29145902395248413},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.24758678674697876},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.16133233904838562}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8113626837730408},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6014175415039062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5329863429069519},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5312974452972412},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.4816626310348511},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.45247355103492737},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.41834622621536255},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.41402655839920044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4096250534057617},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3934439718723297},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3861224055290222},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3438568711280823},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29145902395248413},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.24758678674697876},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.16133233904838562},{"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:upcommons.upc.edu:2117/176983","is_oa":true,"landing_page_url":"https://hdl.handle.net/2117/176983","pdf_url":null,"source":{"id":"https://openalex.org/S4377196262","display_name":"UPCommons institutional repository (Universitat Polit\u00e8cnica de Catalunya)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9617848","host_organization_name":"Universitat Polit\u00e8cnica de Catalunya","host_organization_lineage":["https://openalex.org/I9617848"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:doaj.org/article:c38c0a51f0004bf18cb14862af34da14","is_oa":true,"landing_page_url":"https://doaj.org/article/c38c0a51f0004bf18cb14862af34da14","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 15, Issue 3 (2019)","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:upcommons.upc.edu:2117/176983","is_oa":true,"landing_page_url":"https://hdl.handle.net/2117/176983","pdf_url":null,"source":{"id":"https://openalex.org/S4377196262","display_name":"UPCommons institutional repository (Universitat Polit\u00e8cnica de Catalunya)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9617848","host_organization_name":"Universitat Polit\u00e8cnica de Catalunya","host_organization_lineage":["https://openalex.org/I9617848"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1883207244","display_name":null,"funder_award_id":"61872092","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G3952919966","display_name":"Complexity Theory in Feasible Mathematics","funder_award_id":"P28699","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G6454361319","display_name":null,"funder_award_id":"648276","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W95391657","https://openalex.org/W119698346","https://openalex.org/W193724012","https://openalex.org/W1486674860","https://openalex.org/W1527197079","https://openalex.org/W1565047086","https://openalex.org/W1566033350","https://openalex.org/W1579643516","https://openalex.org/W1591764802","https://openalex.org/W1606810574","https://openalex.org/W1834737061","https://openalex.org/W1965022641","https://openalex.org/W1979514837","https://openalex.org/W1982129592","https://openalex.org/W1984581643","https://openalex.org/W2008237210","https://openalex.org/W2015323017","https://openalex.org/W2027519504","https://openalex.org/W2033042995","https://openalex.org/W2043360684","https://openalex.org/W2044535619","https://openalex.org/W2051700974","https://openalex.org/W2064252342","https://openalex.org/W2071260871","https://openalex.org/W2111829945","https://openalex.org/W2118076394","https://openalex.org/W2128626931","https://openalex.org/W2182677559","https://openalex.org/W2260560831","https://openalex.org/W2490706771","https://openalex.org/W2625266575","https://openalex.org/W2798639752","https://openalex.org/W2798907744","https://openalex.org/W2926972612","https://openalex.org/W2953121505","https://openalex.org/W2963815293","https://openalex.org/W3032071526","https://openalex.org/W4235156957","https://openalex.org/W4254380579"],"related_works":["https://openalex.org/W1834737061","https://openalex.org/W1988772559","https://openalex.org/W2565115296","https://openalex.org/W2024402979","https://openalex.org/W2171811389","https://openalex.org/W1539117866","https://openalex.org/W2041837101","https://openalex.org/W1524939943","https://openalex.org/W4289702104","https://openalex.org/W3028074942"],"abstract_inverted_index":{"The":[0],"parameterized":[1,40,81,91,102],"model-checking":[2,45],"problem":[3,46,64],"for":[4,47,67,106,134],"a":[5,15,24,50,78,101,129,137],"class":[6,20],"of":[7,34,43,53,71,80,118,140],"first-order":[8],"sentences":[9],"(queries)":[10],"asks":[11],"to":[12,113],"decide":[13],"whether":[14],"given":[16,25],"sentence":[17],"from":[18],"the":[19,29,32,35,39,44,59,63,68,75,152],"holds":[21],"true":[22],"in":[23,122],"relational":[26],"structure":[27],"(database);":[28],"parameter":[30],"is":[31,157],"length":[33],"sentence.":[36],"We":[37,98,147],"study":[38,148],"space":[41,86,93,104,121,124,131],"complexity":[42,82],"queries":[48,110,135],"with":[49,136],"bounded":[51,87,108,138,143],"number":[52,139],"variables.":[54],"For":[55],"each":[56],"bound":[57],"on":[58],"quantifier":[60,144],"alternation":[61,145],"rank":[62],"becomes":[65],"complete":[66],"corresponding":[69],"level":[70],"what":[72],"we":[73,127],"call":[74],"tree":[76],"hierarchy,":[77],"hierarchy":[79],"classes":[83],"defined":[84],"via":[85],"alternating":[88],"machines":[89],"between":[90],"logarithmic":[92,103,120],"and":[94,142],"fixed-parameter":[95],"tractable":[96],"time.":[97],"observe":[99],"that":[100,154],"model-checker":[105,133],"existential":[107],"variable":[109],"would":[111],"allow":[112],"improve":[114],"Savitch's":[115,155],"classical":[116],"simulation":[117],"nondeterministic":[119],"deterministic":[123],"$O(\\log^2n)$.":[125],"Further,":[126],"define":[128],"highly":[130],"efficient":[132],"variables":[141],"rank.":[146],"its":[149],"optimality":[150],"under":[151],"assumption":[153],"Theorem":[156],"optimal.":[158]},"counts_by_year":[],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-10-10T00:00:00"}