{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T11:02:21Z","timestamp":1773054141906,"version":"3.50.1"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T00:00:00Z","timestamp":1764201600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"FWF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP210103849"],"award-info":[{"award-number":["DP210103849"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Science Review"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.cosrev.2025.100868","type":"journal-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T18:04:37Z","timestamp":1765562677000},"page":"100868","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Backdoors to satisfaction continued"],"prefix":"10.1016","volume":"60","author":[{"given":"Serge","family":"Gaspers","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cosrev.2025.100868_bib0005","series-title":"LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, Volume 9644 of Lecture Notes in Computer Science","first-page":"1","article-title":"A faster FPT algorithm and a smaller kernel for block graph vertex deletion","author":"Agrawal","year":"2016"},{"key":"10.1016\/j.cosrev.2025.100868_bib0010","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01531068","article-title":"Polynomial-time inference of all valid implications for Horn and related formulae","volume":"1","author":"Boros","year":"1990","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"10.1016\/j.cosrev.2025.100868_bib0015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(94)90033-7","article-title":"Recognition of q-horn formulae in linear time","volume":"55","author":"Boros","year":"1994","journal-title":"Discr. Appl. Math."},{"issue":"2","key":"10.1016\/j.cosrev.2025.100868_bib0020","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s00453-015-0045-3","article-title":"Graph isomorphism parameterized by elimination distance to bounded degree","volume":"75","author":"Bulian","year":"2016","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.cosrev.2025.100868_bib0025","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/s00453-008-9223-x","article-title":"Fixed-parameter approximation: conceptual framework and approximability results","volume":"57","author":"Cai","year":"2010","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.cosrev.2025.100868_bib0030","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0022-0000(03)00074-6","article-title":"On the existence of subexponential parameterized algorithms","volume":"67","author":"Cai","year":"2003","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.cosrev.2025.100868_bib0035","series-title":"Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006), vol. 4169 of Lecture Notes in Computer Science","first-page":"109","article-title":"On parameterized approximability","author":"Chen","year":"2006"},{"key":"10.1016\/j.cosrev.2025.100868_bib0040","series-title":"Proc. 3rd Annual Symp. On Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"issue":"3","key":"10.1016\/j.cosrev.2025.100868_bib0045","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0166-218X(96)00028-5","article-title":"Variable and term removal from boolean formulae","volume":"75","author":"Crama","year":"1997","journal-title":"Discr. Appl. Math."},{"issue":"3","key":"10.1016\/j.cosrev.2025.100868_bib0050","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/j.cosrev.2025.100868_bib0055","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem-proving","volume":"5","author":"Davis","year":"1962","journal-title":"Commun. ACM"},{"key":"10.1016\/j.cosrev.2025.100868_bib0060","series-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"key":"10.1016\/j.cosrev.2025.100868_bib0065","series-title":"Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Volume 4169 of Lecture Notes in Computer Science","first-page":"121","article-title":"Parameterized approximation problems","author":"Downey","year":"2006"},{"issue":"3","key":"10.1016\/j.cosrev.2025.100868_bib0070","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/s10601-023-09362-3","article-title":"CSP beyond tractable constraint languages","volume":"28","author":"Dreier","year":"2023","journal-title":"Constraints"},{"key":"10.1016\/j.cosrev.2025.100868_bib0075","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2024.103520","article-title":"SAT backdoors: depth beats size","volume":"142","author":"Dreier","year":"2024","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.cosrev.2025.100868_bib0080","first-page":"5608","article-title":"Tractable abstract argumentation via backdoor-treewidth","author":"Dvor\u00e1k","year":"2022"},{"issue":"6","key":"10.1016\/j.cosrev.2025.100868_bib0085","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/3560469","article-title":"The silent (r)evolution of SAT","volume":"66","author":"Fichte","year":"2023","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/j.cosrev.2025.100868_bib0090","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.dam.2006.06.020","article-title":"Counting truth assignments of formulas of bounded tree-width or clique-width","volume":"156","author":"Fischer","year":"2008","journal-title":"Discr. Appl. Math."},{"key":"10.1016\/j.cosrev.2025.100868_bib0095","series-title":"36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29\u2013July 2, 2021","first-page":"1","article-title":"Parameterized complexity of elimination distance to first-order logic properties","author":"Fomin","year":"2021"},{"key":"10.1016\/j.cosrev.2025.100868_bib0100","series-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015","first-page":"630","article-title":"Solving D-Sat via backdoors to small treewidth","author":"Fomin","year":"2015"},{"key":"10.1016\/j.cosrev.2025.100868_bib0105","series-title":"Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, Volume 10491 of Lecture Notes in Computer Science","first-page":"20","article-title":"Backdoor treewidth for SAT","author":"Ganian","year":"2017"},{"key":"10.1016\/j.cosrev.2025.100868_bib0110","series-title":"34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), Volume 66 of Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"36:1","article-title":"Combining treewidth and backdoors for CSP","author":"Ganian","year":"2017"},{"key":"10.1016\/j.cosrev.2025.100868_bib0115","first-page":"3741","article-title":"Faster algorithms for weak backdoors","author":"Gaspers","year":"2022"},{"key":"10.1016\/j.cosrev.2025.100868_bib0120","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jcss.2016.10.007","article-title":"Backdoors into heterogeneous classes of SAT and CSP","volume":"85","author":"Gaspers","year":"2017","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.cosrev.2025.100868_bib0125","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1007\/s00453-014-9958-5","article-title":"Backdoors to Q-horn","volume":"74","author":"Gaspers","year":"2016","journal-title":"Algorithmica"},{"key":"10.1016\/j.cosrev.2025.100868_bib0130","series-title":"Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, Volume 7391 of Lecture Notes in Computer Science","first-page":"363","article-title":"Backdoors to acyclic SAT","author":"Gaspers","year":"2012"},{"key":"10.1016\/j.cosrev.2025.100868_bib0135","series-title":"The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, Volume 7370 of Lecture Notes in Computer Science","first-page":"287","article-title":"Backdoors to satisfaction","author":"Gaspers","year":"2012"},{"key":"10.1016\/j.cosrev.2025.100868_bib0140","series-title":"54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA","first-page":"489","article-title":"Strong backdoors to bounded treewidth SAT","author":"Gaspers","year":"2013"},{"issue":"1\u20132","key":"10.1016\/j.cosrev.2025.100868_bib0145","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0004-3702(02)00182-0","article-title":"Fixed-parameter complexity in AI and nonmonotonic reasoning","volume":"138","author":"Gottlob","year":"2002","journal-title":"Artif. Intell."},{"key":"10.1016\/j.cosrev.2025.100868_bib0150","series-title":"1st International Workshop on Parameterized and Exact Computation (IWPEC 2004), Volume 3162 of Lecture Notes in Computer Science","first-page":"162","article-title":"A structural view on parameterizing problems: Distance from triviality","author":"Guo","year":"2004"},{"key":"10.1016\/j.cosrev.2025.100868_bib0155","series-title":"STACS 2024: 41st International Symposium on Theoretical Aspects of Computer Science, Volume 289 of Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"40:1","article-title":"A faster algorithm for vertex cover parameterized by solution size","author":"Harris","year":"2024"},{"issue":"4","key":"10.1016\/j.cosrev.2025.100868_bib0160","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","article-title":"Which problems have strongly exponential complexity?","volume":"63","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.cosrev.2025.100868_bib0165","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0218026","article-title":"CNF-satisfiability test by counting and polynomial average time","volume":"18","author":"Iwama","year":"1989","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.cosrev.2025.100868_bib0170","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02983372","article-title":"Nested satisfiability","volume":"28","author":"Knuth","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/j.cosrev.2025.100868_bib0175","series-title":"The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability","author":"Knuth","year":"2015"},{"issue":"3","key":"10.1016\/j.cosrev.2025.100868_bib0180","first-page":"265","article-title":"Universal sequential search problems","volume":"9","author":"Levin","year":"1973","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"10.1016\/j.cosrev.2025.100868_bib0185","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/322047.322059","article-title":"Renaming a set of clauses as a horn set","volume":"25","author":"Lewis","year":"1978","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.cosrev.2025.100868_bib0190","first-page":":15:1","article-title":"Faster parameterized algorithms using linear programming","volume":"11","author":"Lokshtanov","year":"2014","journal-title":"ACM Trans. Algor."},{"key":"10.1016\/j.cosrev.2025.100868_bib0195","series-title":"49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France, Volume 229 of LIPIcs","first-page":"91:1","article-title":"Backdoor sets on nowhere dense SAT","author":"Lokshtanov","year":"2022"},{"key":"10.1016\/j.cosrev.2025.100868_bib0200","series-title":"46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia, Volume 202 of LIPIcs","first-page":"73:1","article-title":"Recursive backdoors for SAT","author":"M\u00e4hlmann","year":"2021"},{"issue":"1","key":"10.1016\/j.cosrev.2025.100868_bib0205","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/s00453-009-9326-z","article-title":"Parameterized complexity and local search approaches for the stable marriage problem with ties","volume":"58","author":"Marx","year":"2010","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.cosrev.2025.100868_bib0210","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.disopt.2010.07.004","article-title":"Stable assignment with couples: parameterized complexity and local search","volume":"8","author":"Marx","year":"2011","journal-title":"Discret. Optim."},{"key":"10.1016\/j.cosrev.2025.100868_bib0215","series-title":"Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings, Volume 7962 of Lecture Notes in Computer Science","first-page":"394","article-title":"Upper and lower bounds for weak backdoor set detection","author":"Misra","year":"2013"},{"issue":"6","key":"10.1016\/j.cosrev.2025.100868_bib0220","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","article-title":"Tree-depth, subgraph coloring and homomorphism bounds","volume":"27","author":"Nesetril","year":"2006","journal-title":"Eur. J. Combin."},{"key":"10.1016\/j.cosrev.2025.100868_bib0225","series-title":"Sparsity - Graphs, Structures, and Algorithms, Volume 28 of Algorithms and Combinatorics","author":"Ne\u0161et\u0159il","year":"2012"},{"key":"10.1016\/j.cosrev.2025.100868_bib0230","series-title":"Proceedings of SAT 2004 (Seventh International Conference on Theory and Applications of Satisfiability Testing, 10\u201313 May, 2004, Vancouver, BC, Canada)","first-page":"96","article-title":"Detecting backdoor sets with respect to horn and binary clauses","author":"Nishimura","year":"2004"},{"issue":"7\u20138","key":"10.1016\/j.cosrev.2025.100868_bib0235","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s00236-007-0056-x","article-title":"Solving #SAT using vertex covers","volume":"44","author":"Nishimura","year":"2007","journal-title":"Acta Inform."},{"key":"10.1016\/j.cosrev.2025.100868_bib0240","series-title":"Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence","first-page":"1403","article-title":"Backdoor dnfs","author":"Ordyniak","year":"2021"},{"key":"10.1016\/j.cosrev.2025.100868_bib0245","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7","first-page":"1739","article-title":"Linear time parameterized algorithms via skew-symmetric multicuts","author":"Ramanujan","year":"2014"},{"key":"10.1016\/j.cosrev.2025.100868_bib0250","series-title":"Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, Volume 5125 of Lecture Notes in Computer Science","first-page":"551","article-title":"Almost 2-Sat is fixed-parameter tractable (extended abstract)","author":"Razgon","year":"2008"},{"key":"10.1016\/j.cosrev.2025.100868_bib0255","series-title":"AAAI 08, Twenty-Third Conference on Artificial Intelligence, Chicago, Illinois, July 13\u201317, 2008","first-page":"363","article-title":"Backdoor trees","author":"Samer","year":"2008"},{"issue":"1","key":"10.1016\/j.cosrev.2025.100868_bib0260","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.jda.2009.06.002","article-title":"Algorithms for propositional model counting","volume":"8","author":"Samer","year":"2010","journal-title":"J. Discrete Algorithms"},{"key":"10.1016\/j.cosrev.2025.100868_bib0265","first-page":"693","article-title":"Fixed-parameter tractability","author":"Samer","year":"2021"},{"key":"10.1016\/j.cosrev.2025.100868_bib0270","series-title":"Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978)","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/j.cosrev.2025.100868_bib0275","series-title":"Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers, Volume 2919 of Lecture Notes in Computer Science","first-page":"188","article-title":"On fixed-parameter tractable parameterizations of SAT","author":"Szeider","year":"2004"},{"issue":"1\u20133","key":"10.1016\/j.cosrev.2025.100868_bib0280","first-page":"73","article-title":"Backdoor sets for DLL subsolvers","volume":"35","author":"Szeider","year":"2005","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/j.cosrev.2025.100868_bib0285","series-title":"Link\u00f6ping University, Sweden","article-title":"Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems","author":"Wahlstr\u00f6m","year":"2007"},{"key":"10.1016\/j.cosrev.2025.100868_bib0290","series-title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI 2003","first-page":"1173","article-title":"Backdoors to typical case complexity","author":"Williams","year":"2003"}],"container-title":["Computer Science Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013725001443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574013725001443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T09:03:23Z","timestamp":1773047003000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574013725001443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":58,"alternative-id":["S1574013725001443"],"URL":"https:\/\/doi.org\/10.1016\/j.cosrev.2025.100868","relation":{},"ISSN":["1574-0137"],"issn-type":[{"value":"1574-0137","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Backdoors to satisfaction continued","name":"articletitle","label":"Article Title"},{"value":"Computer Science Review","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cosrev.2025.100868","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Authors. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"100868"}}