{"id":"https://openalex.org/W3147498698","doi":"https://doi.org/10.1145/3517129","title":"Parameterized Complexity of Elimination Distance to First-Order Logic Properties","display_name":"Parameterized Complexity of Elimination Distance to First-Order Logic Properties","publication_year":2022,"publication_date":"2022-03-29","ids":{"openalex":"https://openalex.org/W3147498698","doi":"https://doi.org/10.1145/3517129","mag":"3147498698"},"language":"en","primary_location":{"id":"doi:10.1145/3517129","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3517129","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-03389854","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway","UiB - Department of Informatics [Bergen] (Universitetet i Bergen, Institutt for informatikk, Postboks 7803, N-5020 Bergen - Norway)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"UiB - Department of Informatics [Bergen] (Universitetet i Bergen, Institutt for informatikk, Postboks 7803, N-5020 Bergen - Norway)","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051709720","display_name":"Petr A. Golovach","orcid":"https://orcid.org/0000-0002-2619-2990"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Petr A. Golovach","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway","UiB - Department of Informatics [Bergen] (Universitetet i Bergen, Institutt for informatikk, Postboks 7803, N-5020 Bergen - Norway)"],"raw_orcid":"https://orcid.org/0000-0002-2619-2990","affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"UiB - Department of Informatics [Bergen] (Universitetet i Bergen, Institutt for informatikk, Postboks 7803, N-5020 Bergen - Norway)","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085447779","display_name":"Dimitrios M. Thilikos","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dimitrios M. Thilikos","raw_affiliation_strings":["LIRMM, Univ Montpellier, CNRS, Montpellier, France","ALGCO - Algorithmes, Graphes et Combinatoire (LIRMM, 161 rue Ada, 34000 Montpellier - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIRMM, Univ Montpellier, CNRS, Montpellier, France","institution_ids":["https://openalex.org/I4210101743","https://openalex.org/I19894307","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"ALGCO - Algorithmes, Graphes et Combinatoire (LIRMM, 161 rue Ada, 34000 Montpellier - France)","institution_ids":["https://openalex.org/I4210101743"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075328697"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":0.6034,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68341635,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":"3","first_page":"1","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.998199999332428,"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.9955000281333923,"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/mathematics","display_name":"Mathematics","score":0.7792991995811462},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7121737003326416},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.6396171450614929},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6299598217010498},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.5824694633483887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5668455362319946},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5320953130722046},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4748842120170593},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.42891162633895874},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4286189675331116},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.08865225315093994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07612848281860352}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7792991995811462},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7121737003326416},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.6396171450614929},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6299598217010498},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.5824694633483887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5668455362319946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5320953130722046},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4748842120170593},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.42891162633895874},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4286189675331116},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.08865225315093994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07612848281860352},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"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/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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3517129","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3517129","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03389854v2","is_oa":true,"landing_page_url":"https://hal.science/hal-03389854","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"ACM Transactions on Computational Logic, 2020, 23 (3), pp.17. ⟨10.1145/3517129⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03389854v2","is_oa":true,"landing_page_url":"https://hal.science/hal-03389854","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"ACM Transactions on Computational Logic, 2020, 23 (3), pp.17. ⟨10.1145/3517129⟩","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1008748165","https://openalex.org/W1517036688","https://openalex.org/W1549008998","https://openalex.org/W1570425181","https://openalex.org/W1623604111","https://openalex.org/W1777447092","https://openalex.org/W1857705078","https://openalex.org/W1989783863","https://openalex.org/W2004181701","https://openalex.org/W2039100365","https://openalex.org/W2052210031","https://openalex.org/W2055288944","https://openalex.org/W2066585576","https://openalex.org/W2083951446","https://openalex.org/W2099200602","https://openalex.org/W2116087731","https://openalex.org/W2128203754","https://openalex.org/W2471129545","https://openalex.org/W2787369796","https://openalex.org/W2798588639","https://openalex.org/W2914414140","https://openalex.org/W2937927637","https://openalex.org/W2963662357","https://openalex.org/W2964266750","https://openalex.org/W3014089325","https://openalex.org/W3038423595","https://openalex.org/W3039948875","https://openalex.org/W3082355219","https://openalex.org/W3114248331","https://openalex.org/W3139366516","https://openalex.org/W3162608353","https://openalex.org/W3166550250","https://openalex.org/W4285719527","https://openalex.org/W4287727430"],"related_works":["https://openalex.org/W3028074942","https://openalex.org/W2367367674","https://openalex.org/W2110257077","https://openalex.org/W2950293817","https://openalex.org/W4292614342","https://openalex.org/W2338270372","https://openalex.org/W2369611481","https://openalex.org/W2502556751","https://openalex.org/W1488995571","https://openalex.org/W604148464"],"abstract_inverted_index":{"The":[0],"elimination":[1,25,120,205],"distance":[2,121,206],"to":[3,27,125],"some":[4],"target":[5],"graph":[6,12,28,64,124],"property":[7,65],"P":[8,66,126],"is":[9,58,112,134,207],"a":[10,69,113,123,160,165,177],"general":[11,178],"modification":[13],"parameter":[14],"introduced":[15],"by":[16,40,68,138,147,173],"Bulian":[17],"and":[18,43],"Dawar.":[19],"We":[20,34,169],"initiate":[21],"the":[22,36,47,59,83,119],"study":[23],"of":[24,49,51,82,122,144,156],"distances":[26],"properties":[29],"expressible":[30,67,146],"in":[31],"first-order":[32,52,115],"logic.":[33],"delimit":[35],"problem\u2019s":[37],"fixed-parameter":[38,135],"tractability":[39],"identifying":[41],"sufficient":[42],"necessary":[44],"conditions":[45],"on":[46],"structure":[48],"prefixes":[50],"logic":[53],"formulas.":[54],"Our":[55],"main":[56],"result":[57],"following":[60],"meta-theorem:":[61],"For":[62],"every":[63],"first":[70],"order-logic":[71],"formula":[72],"\\(":[73,85,109,130,139,150,195,208],"\\varphi":[74,87,196],"\\in":[75,197],"\\Sigma":[76,151],"_3":[77,152,199],"\\)":[78,107,111,132,141,153,200,211],",":[79,133,201],"that":[80,175],"is,":[81],"form":[84],"\\begin{equation*}":[86],"=\\exists":[88],"x_1\\exists":[89],"x_2\\cdots":[90],"\\exists":[91,100,103],"x_r\\":[92],"\\":[93,99],"\\forall":[94,97],"y_{1}\\forall":[95],"y_{2}\\cdots":[96],"y_{s}\\":[98],"z_1\\exists":[101],"z_2\\cdots":[102],"z_t~~":[104],"\\psi":[105,110],",\\end{equation*}":[106],"where":[108],"quantifier-free":[114],"formula,":[116],"checking":[117],"whether":[118],"does":[127,180],"not":[128,181],"exceed":[129],"k":[131,140],"tractable":[136],"parameterized":[137],".":[142],"Properties":[143],"graphs":[145],"formulas":[148,184,194],"from":[149],"include":[154],"being":[155],"bounded":[157,166],"degree,":[158],"excluding":[159],"forbidden":[161],"subgraph,":[162],"or":[163],"containing":[164],"dominating":[167],"set.":[168],"complement":[170],"this":[171],"theorem":[172],"showing":[174],"such":[176],"statement":[179],"hold":[182],"for":[183,202],"with":[185],"even":[186],"slightly":[187],"more":[188],"expressive":[189],"prefix":[190],"structure:":[191],"There":[192],"are":[193],"\\Pi":[198],"which":[203],"computing":[204],"{\\sf":[209],"W}[2]":[210],"-hard.":[212]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}