{"id":"https://openalex.org/W2891208999","doi":"https://doi.org/10.1007/s00453-018-0515-5","title":"Backdoors for Linear Temporal Logic","display_name":"Backdoors for Linear Temporal Logic","publication_year":2018,"publication_date":"2018-09-18","ids":{"openalex":"https://openalex.org/W2891208999","doi":"https://doi.org/10.1007/s00453-018-0515-5","mag":"2891208999","pmid":"https://pubmed.ncbi.nlm.nih.gov/30828121"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-018-0515-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0515-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0515-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite","pubmed"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0515-5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":["1Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstrasse 4, 30167 Hannover, Germany","Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstrasse 4, 30167, Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"1Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstrasse 4, 30167 Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]},{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstrasse 4, 30167, Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017076947","display_name":"Sebastian Ordyniak","orcid":"https://orcid.org/0000-0003-1935-651X"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sebastian Ordyniak","raw_affiliation_strings":["2Algorithms Group, University of Sheffield, Regent Court, 211 Portobello, Sheffield, S1 4DP UK","Algorithms Group, University of Sheffield, Regent Court, 211 Portobello, Sheffield, S1 4DP, UK"],"affiliations":[{"raw_affiliation_string":"2Algorithms Group, University of Sheffield, Regent Court, 211 Portobello, Sheffield, S1 4DP UK","institution_ids":["https://openalex.org/I91136226"]},{"raw_affiliation_string":"Algorithms Group, University of Sheffield, Regent Court, 211 Portobello, Sheffield, S1 4DP, UK","institution_ids":["https://openalex.org/I91136226"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112411811","display_name":"M. S. Ramanujan","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"M. S. Ramanujan","raw_affiliation_strings":["3Institut f\u00fcr Computergraphik und Algorithmen 186/1, Technische Universit\u00e4t Wien, Favoritenstra\u00dfe 9-11, 1040 Wien, Austria","Institut f\u00fcr Computergraphik und Algorithmen 186/1, Technische Universit\u00e4t Wien, Favoritenstra\u00dfe 9\u201311, 1040, Wien, Austria"],"affiliations":[{"raw_affiliation_string":"3Institut f\u00fcr Computergraphik und Algorithmen 186/1, Technische Universit\u00e4t Wien, Favoritenstra\u00dfe 9-11, 1040 Wien, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Institut f\u00fcr Computergraphik und Algorithmen 186/1, Technische Universit\u00e4t Wien, Favoritenstra\u00dfe 9\u201311, 1040, Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014491613","display_name":"Irena Schindler","orcid":null},"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":"Irena Schindler","raw_affiliation_strings":["1Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstrasse 4, 30167 Hannover, Germany","Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstrasse 4, 30167, Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"1Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstrasse 4, 30167 Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]},{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Appelstrasse 4, 30167, Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017076947"],"corresponding_institution_ids":["https://openalex.org/I91136226"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.6412,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72309132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"81","issue":"2","first_page":"476","last_page":"496"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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.9991999864578247,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"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.8715444803237915},{"id":"https://openalex.org/keywords/backdoor","display_name":"Backdoor","score":0.8485764265060425},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.6573227643966675},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.6035040616989136},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5672915577888489},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5366240739822388},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5351541638374329},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5291417241096497},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.48926374316215515},{"id":"https://openalex.org/keywords/french-horn","display_name":"French horn","score":0.46271273493766785},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45216500759124756},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44935134053230286},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43518269062042236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3635542392730713},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32957208156585693}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8715444803237915},{"id":"https://openalex.org/C2781045450","wikidata":"https://www.wikidata.org/wiki/Q254569","display_name":"Backdoor","level":2,"score":0.8485764265060425},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.6573227643966675},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.6035040616989136},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5672915577888489},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5366240739822388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5351541638374329},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5291417241096497},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.48926374316215515},{"id":"https://openalex.org/C152076505","wikidata":"https://www.wikidata.org/wiki/Q1126540","display_name":"French horn","level":2,"score":0.46271273493766785},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45216500759124756},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44935134053230286},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43518269062042236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3635542392730713},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32957208156585693},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C19417346","wikidata":"https://www.wikidata.org/wiki/Q7922","display_name":"Pedagogy","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00453-018-0515-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0515-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0515-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmid:30828121","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/30828121","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":null},{"id":"pmh:oai:europepmc.org:5378650","is_oa":true,"landing_page_url":"http://europepmc.org/pmc/articles/PMC6373296","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"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":"","raw_type":"Text"},{"id":"pmh:oai:pubmedcentral.nih.gov:6373296","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/6373296","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica","raw_type":"Text"},{"id":"pmh:oai:www.repo.uni-hannover.de:123456789/1292","is_oa":true,"landing_page_url":"http://www.repo.uni-hannover.de/handle/123456789/1292","pdf_url":null,"source":{"id":"https://openalex.org/S4306401575","display_name":"Institutional Repository of Leibniz Universit\u00e4t Hannover (Leibniz Universit\u00e4t Hannover)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114112103","host_organization_name":"Leibniz University Hannover","host_organization_lineage":["https://openalex.org/I114112103"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Leibniz International Proceedings in Informatics, LIPIcs 63 (2017)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.15488/1267","is_oa":true,"landing_page_url":"https://doi.org/10.15488/1267","pdf_url":null,"source":{"id":"https://openalex.org/S7407052956","display_name":"Leibniz Universit\u00e4t Hannover","issn_l":null,"issn":[],"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1007/s00453-018-0515-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-018-0515-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-018-0515-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1727132260","display_name":null,"funder_award_id":"ME 4279/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G3348202372","display_name":null,"funder_award_id":"279/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G4763170557","display_name":null,"funder_award_id":"project P2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5610024377","display_name":null,"funder_award_id":"P26696","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2891208999.pdf","grobid_xml":"https://content.openalex.org/works/W2891208999.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W12052983","https://openalex.org/W55334476","https://openalex.org/W57966795","https://openalex.org/W104186012","https://openalex.org/W203718333","https://openalex.org/W1509716515","https://openalex.org/W1540883472","https://openalex.org/W1555450189","https://openalex.org/W1559732456","https://openalex.org/W1581108661","https://openalex.org/W1590315663","https://openalex.org/W1709155369","https://openalex.org/W1732327014","https://openalex.org/W1788645111","https://openalex.org/W1917834884","https://openalex.org/W1981561399","https://openalex.org/W1992762998","https://openalex.org/W2004532354","https://openalex.org/W2007046843","https://openalex.org/W2009147258","https://openalex.org/W2014363582","https://openalex.org/W2018794476","https://openalex.org/W2023808162","https://openalex.org/W2026379532","https://openalex.org/W2039585983","https://openalex.org/W2041433942","https://openalex.org/W2053231467","https://openalex.org/W2059451253","https://openalex.org/W2067441543","https://openalex.org/W2099091523","https://openalex.org/W2114975369","https://openalex.org/W2116087731","https://openalex.org/W2131225255","https://openalex.org/W2141898804","https://openalex.org/W2187890375","https://openalex.org/W2211445239","https://openalex.org/W2951449870","https://openalex.org/W3144889436","https://openalex.org/W4213219346","https://openalex.org/W4285719527","https://openalex.org/W4294121455"],"related_works":["https://openalex.org/W2275719454","https://openalex.org/W1559927413","https://openalex.org/W2589788139","https://openalex.org/W2963979038","https://openalex.org/W2891208999","https://openalex.org/W4294660805","https://openalex.org/W1781010059","https://openalex.org/W3102946820","https://openalex.org/W1853345069","https://openalex.org/W2088800856"],"abstract_inverted_index":{"In":[0],"the":[1,6,11,17,26,30,35,38,50,60,68,80,92,99,113],"present":[2],"paper,":[3],"we":[4,58],"introduce":[5],"backdoor":[7,43],"set":[8],"approach":[9],"into":[10,49],"field":[12],"of":[13,20,29,37,47,52,63,70,82],"temporal":[14,22],"logic":[15],"for":[16,65,89],"global":[18],"fragment":[19],"linear":[21],"logic.":[23],"We":[24,40,86],"study":[25],"parameterized":[27,33],"complexity":[28,81,100],"satisfiability":[31],"problem":[32,93],"by":[34],"size":[36],"backdoor.":[39],"distinguish":[41],"between":[42],"detection":[44],"and":[45,54,67],"evaluation":[46,83],"backdoors":[48],"fragments":[51,62],"Horn":[53,97],"Krom":[55,90],"formulas.":[56],"Here":[57],"classify":[59],"operator":[61,115],"globally-operators":[64],"past/future/always,":[66],"combination":[69],"them.":[71],"Detection":[72],"is":[73,94,101],"shown":[74,102],"to":[75,103],"be":[76,104],"fixed-parameter":[77],"tractable":[78,108],"whereas":[79],"behaves":[84],"differently.":[85],"show":[87],"that":[88],"formulas":[91],"paraNP-complete.":[95],"For":[96],"formulas,":[98],"either":[105],"fixed":[106],"parameter":[107],"or":[109],"paraNP-complete":[110],"depending":[111],"on":[112],"considered":[114],"fragment.":[116]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}