{"id":"https://openalex.org/W2952647121","doi":"https://doi.org/10.1109/lics.2017.8005094","title":"A fine-grained hierarchy of hard problems in the separated fragment","display_name":"A fine-grained hierarchy of hard problems in the separated fragment","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2952647121","doi":"https://doi.org/10.1109/lics.2017.8005094","mag":"2952647121"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01592172v1/file/VoigtLICS.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034642471","display_name":"Marco Voigt","orcid":"https://orcid.org/0000-0002-5666-7125"},"institutions":[{"id":"https://openalex.org/I4210155607","display_name":"Laboratoire d'Informatique en Images et Syst\u00e8mes d'Information","ror":"https://ror.org/04dv4he91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I112936343","https://openalex.org/I1294671590","https://openalex.org/I188626449","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210155607","https://openalex.org/I48430043"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE","FR"],"is_corresponding":true,"raw_author_name":"Marco Voigt","raw_affiliation_strings":["Saarbr\u00fccken Graduate School of Computer Science, Saarland University","Saarland Informatics Campus, Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","VERIDIS - Modeling and Verification of Distributed Algorithms and Systems (615 rue du Jardin Botanique 54600 Villers-l\u00e8s-Nancy - France)","MPII - Max-Planck-Institut f\u00fcr Informatik (Campus E-1 4, 66123 Saarbr\u00fccken, Germany - Germany)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarbr\u00fccken Graduate School of Computer Science, Saarland University","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Saarland Informatics Campus, Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"VERIDIS - Modeling and Verification of Distributed Algorithms and Systems (615 rue du Jardin Botanique 54600 Villers-l\u00e8s-Nancy - France)","institution_ids":["https://openalex.org/I4210155607"]},{"raw_affiliation_string":"MPII - Max-Planck-Institut f\u00fcr Informatik (Campus E-1 4, 66123 Saarbr\u00fccken, Germany - Germany)","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034642471"],"corresponding_institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I4210155607","https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":0.9564,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79295775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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.9984999895095825,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9957000017166138,"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/decidability","display_name":"Decidability","score":0.6863920092582703},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.6006946563720703},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5933994054794312},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5767079591751099},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5511118173599243},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5032057166099548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40378451347351074},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38948190212249756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2960139513015747},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22834214568138123}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6863920092582703},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.6006946563720703},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5933994054794312},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5767079591751099},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5511118173599243},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5032057166099548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40378451347351074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38948190212249756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2960139513015747},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22834214568138123}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics.2017.8005094","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01592172v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01592172","pdf_url":"https://inria.hal.science/hal-01592172v1/file/VoigtLICS.pdf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS 2017 - 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland. pp.1 - 12, &#x27E8;10.1109/LICS.2017.8005094&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01592172v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01592172","pdf_url":"https://inria.hal.science/hal-01592172v1/file/VoigtLICS.pdf","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LICS 2017 - 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland. pp.1 - 12, &#x27E8;10.1109/LICS.2017.8005094&#x27E9;","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2952647121.pdf","grobid_xml":"https://content.openalex.org/works/W2952647121.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W78199058","https://openalex.org/W313985849","https://openalex.org/W1483892218","https://openalex.org/W1549008998","https://openalex.org/W1980967952","https://openalex.org/W1991981864","https://openalex.org/W2036265926","https://openalex.org/W2066989651","https://openalex.org/W2086470346","https://openalex.org/W2124580444","https://openalex.org/W2276652507","https://openalex.org/W2341631904","https://openalex.org/W2555906575","https://openalex.org/W2606123530","https://openalex.org/W2951261477","https://openalex.org/W2952647121","https://openalex.org/W3102630320","https://openalex.org/W4237721941","https://openalex.org/W6603162035","https://openalex.org/W6814586945"],"related_works":["https://openalex.org/W2752930545","https://openalex.org/W2040430117","https://openalex.org/W3101316517","https://openalex.org/W2294297515","https://openalex.org/W4290930689","https://openalex.org/W3093966545","https://openalex.org/W2585890227","https://openalex.org/W3217105492","https://openalex.org/W2072122432","https://openalex.org/W1543051890"],"abstract_inverted_index":{"Recently,":[0],"the":[1,34,86,96,111,146,149,153,185,196],"separated":[2],"fragment":[3],"(SF)":[4],"has":[5,192],"been":[6,193],"introduced":[7],"and":[8,19,104],"proved":[9],"to":[10,37],"be":[11,78],"decidable.":[12],"Its":[13],"defining":[14],"principle":[15],"is":[16,42,73,145,174,180],"that":[17,163,172],"universally":[18],"existentially":[20],"quantified":[21],"variables":[22,118,139],"may":[23],"not":[24],"occur":[25],"together":[26],"in":[27,44,70,80,108,130,140,176],"atoms.":[28,141],"The":[29],"known":[30,194],"upper":[31,103],"bound":[32,107],"on":[33,184],"time":[35],"required":[36],"decide":[38],"SF's":[39],"satisfiability":[40,76,150],"problem":[41,151],"formulated":[43],"terms":[45,109],"of":[46,95,98,110,114,116,123,138,148,159,198],"quantifier":[47,74,128],"alternations:":[48],"Given":[49],"an":[50,102],"SF":[51,155,161,179],"sentence":[52,132],"\u2203z\u20d7\u2200x\u20d7":[53],"<sub":[54,58,62,66,156],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[55,59,63,67,157],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[56,60],"\u2203y\u20d7":[57,65],"...\u2200x\u20d7":[61],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sub>":[64,68],".\u03c8":[69],"which":[71],"\u03c8":[72],"free,":[75],"can":[77],"decided":[79],"non-deterministic":[81],"n-fold":[82],"exponential":[83],"time.":[84],"In":[85],"present":[87],"paper,":[88],"we":[89,170],"conduct":[90],"a":[91,105,131],"more":[92],"fine-grained":[93],"analysis":[94],"complexity":[97],"SF-satisfiability.":[99],"We":[100],"derive":[101],"lower":[106,189],"degree":[112,165],"\u2202":[113],"interaction":[115],"existential":[117,127],"(short:":[119],"degree)-a":[120],"novel":[121],"measure":[122],"how":[124],"many":[125],"separate":[126],"blocks":[129],"are":[133],"connected":[134],"via":[135],"joint":[136],"occurrences":[137],"Our":[142],"main":[143],"result":[144],"k-NEXPTIME-completeness":[147],"for":[152],"set":[154],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u2202\u2264k</sub>":[158],"all":[160],"sentences":[162],"have":[164],"k":[166],"or":[167],"smaller.":[168],"Consequently,":[169],"show":[171],"SF-satisfiability":[173,199],"non-elementary":[175],"general,":[177],"since":[178],"defined":[181],"without":[182],"restrictions":[183],"degree.":[186],"Beyond":[187],"trivial":[188],"bounds,":[190],"nothing":[191],"about":[195],"hardness":[197],"so":[200],"far.":[201]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}