{"id":"https://openalex.org/W4309229081","doi":"https://doi.org/10.1093/logcom/exac070","title":"A parameterized view on the complexity of dependence and independence logic","display_name":"A parameterized view on the complexity of dependence and independence logic","publication_year":2022,"publication_date":"2022-10-06","ids":{"openalex":"https://openalex.org/W4309229081","doi":"https://doi.org/10.1093/logcom/exac070"},"language":"en","primary_location":{"id":"doi:10.1093/logcom/exac070","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exac070","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10138/353242","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069777444","display_name":"Juha Kontinen","orcid":"https://orcid.org/0000-0003-0115-5154"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Juha Kontinen","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Helsinki , PL 68, 00014 Helsinki, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Helsinki , PL 68, 00014 Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025571978","display_name":"Arne Meier","orcid":"https://orcid.org/0000-0002-8061-5376"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Arne Meier","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik , Leibniz Universit\u00e4t Hannover, 30167 Hannover, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik , Leibniz Universit\u00e4t Hannover, 30167 Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011855160","display_name":"Yasir Mahmood","orcid":"https://orcid.org/0000-0002-5651-5391"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Yasir Mahmood","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover , 30167 Hannover, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover , 30167 Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011855160"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":0.2874,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59150645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"32","issue":"8","first_page":"1624","last_page":"1644"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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.9993000030517578,"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.9958000183105469,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9904000163078308,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9148799777030945},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.7595852613449097},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.6459336280822754},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.6402917504310608},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5169712901115417},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49537980556488037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4754854440689087},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4446309506893158},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4414115250110626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4408293664455414},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.42728468775749207},{"id":"https://openalex.org/keywords/decision-tree-model","display_name":"Decision tree model","score":0.42481881380081177},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.42199212312698364},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41436463594436646},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.41434356570243835},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40575268864631653},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3249598741531372},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21479496359825134},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11529466509819031},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09155803918838501},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.0854986310005188},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.08012723922729492}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9148799777030945},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.7595852613449097},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.6459336280822754},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.6402917504310608},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5169712901115417},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49537980556488037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4754854440689087},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4446309506893158},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4414115250110626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4408293664455414},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.42728468775749207},{"id":"https://openalex.org/C56289965","wikidata":"https://www.wikidata.org/wiki/Q5249246","display_name":"Decision tree model","level":3,"score":0.42481881380081177},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.42199212312698364},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41436463594436646},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.41434356570243835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40575268864631653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3249598741531372},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21479496359825134},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11529466509819031},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09155803918838501},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.0854986310005188},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.08012723922729492},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/logcom/exac070","is_oa":false,"landing_page_url":"https://doi.org/10.1093/logcom/exac070","pdf_url":null,"source":{"id":"https://openalex.org/S47057106","display_name":"Journal of Logic and Computation","issn_l":"0955-792X","issn":["0955-792X","1465-363X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Logic and Computation","raw_type":"journal-article"},{"id":"pmh:oai:helda.helsinki.fi:10138/353242","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/353242","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"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":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:helda.helsinki.fi:10138/353242","is_oa":true,"landing_page_url":"http://hdl.handle.net/10138/353242","pdf_url":null,"source":{"id":"https://openalex.org/S4210213322","display_name":"Ty\u00f6v\u00e4entutkimus Vuosikirja","issn_l":"0784-1272","issn":["0784-1272","1459-7780"],"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":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4000000059604645,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W118899628","https://openalex.org/W1482215821","https://openalex.org/W1489366126","https://openalex.org/W1926269500","https://openalex.org/W1991388620","https://openalex.org/W2002722727","https://openalex.org/W2003216212","https://openalex.org/W2034690236","https://openalex.org/W2044535619","https://openalex.org/W2079986269","https://openalex.org/W2085550081","https://openalex.org/W2159003936","https://openalex.org/W2169393469","https://openalex.org/W2490706771","https://openalex.org/W2500618074","https://openalex.org/W2795570893","https://openalex.org/W2949632748","https://openalex.org/W2964051209","https://openalex.org/W2964104541","https://openalex.org/W3008834762","https://openalex.org/W3103522412","https://openalex.org/W3174233257","https://openalex.org/W4206807714","https://openalex.org/W4213009134","https://openalex.org/W4252380885","https://openalex.org/W6628898632","https://openalex.org/W6639927100","https://openalex.org/W6640647878","https://openalex.org/W6678661637","https://openalex.org/W6683227944","https://openalex.org/W6737397395","https://openalex.org/W6759261746","https://openalex.org/W6773735187","https://openalex.org/W6797327497"],"related_works":["https://openalex.org/W3021939903","https://openalex.org/W2951920979","https://openalex.org/W4302851388","https://openalex.org/W1627538354","https://openalex.org/W2550995564","https://openalex.org/W2108500987","https://openalex.org/W1817813502","https://openalex.org/W3200143297","https://openalex.org/W4286970061","https://openalex.org/W4205298752"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,38],"paper,":[3],"we":[4,97],"investigate":[5],"the":[6,23,41,50,53,57,60,63,66,77,88,100,103,112,120],"parameterized":[7,78],"complexity":[8,79,101],"of":[9,25,33,43,52,56,62,68,76,80,87,102,111,119],"model":[10,81,113],"checking":[11,82,114],"for":[12,37],"Dependence":[13],"and":[14,65,83,92,108],"Independence":[15],"logic,":[16],"which":[17],"are":[18],"well":[19],"studied":[20],"logics":[21],"in":[22],"area":[24],"Team":[26],"Semantics.":[27],"We":[28,71],"start":[29],"with":[30],"a":[31,73,85],"list":[32],"nine":[34],"immediate":[35],"parameterizations":[36],"problem,":[39],"namely":[40],"number":[42],"disjunctions":[44],"(i.e.":[45],"splits)/(free)":[46],"variables/universal":[47],"quantifiers,":[48],"formula-size,":[49],"tree-width":[51],"Gaifman":[54],"graph":[55],"input":[58],"structure,":[59],"size":[61],"universe/team":[64],"arity":[67],"dependence":[69],"atoms.":[70],"present":[72],"comprehensive":[74],"picture":[75],"obtain":[84],"division":[86],"problem":[89,115],"into":[90],"tractable":[91],"various":[93],"intractable":[94],"degrees.":[95],"Furthermore,":[96],"also":[98],"consider":[99],"most":[104],"important":[105],"variants":[106],"(data":[107],"expression":[109],"complexity)":[110],"by":[116],"fixing":[117],"parts":[118],"input.":[121]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}