[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-267879-105":59,"doc-detail-267879-en":131},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":124,"head_meta":126,"extra_data":128,"updated_unix":130},105,"en","handbook-of-satisfiability-chapter-1-proof-complexity-and-sat-solving","Handbook of Satis􀀌ability - Chapter 1 - Proof Complexity and SAT Solving","","This chapter introduces the satisfiability problem (SAT) as a foundational concept for computer science theory and automatic theorem proving. It frames proof complexity as the study of proof difficulty and search complexity, connecting SAT’s NP-completeness and reductions to broader hardness assumptions such as SETH. It contrasts theoretical infeasibility with practical SAT solver success, then motivates analyzing reasoning power through proof systems and key algorithmic approaches like CDCL, extended resolution, and algebraic or geometric methods.",{"@graph":69,"@context":123},[70,84,106],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/handbook-of-satisfiability-chapter-1-proof-complexity-and-sat-solving/267879/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/handbook-of-satisfiability-chapter-1-proof-complexity-and-sat-solving/267879.png","ImageObject",300,407,{"name":92,"@type":93},"Liam","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-09","2026-09-14",true,{"@type":102,"interactionType":103,"userInteractionCount":105},"InteractionCounter",{"@type":104},"ViewAction",17,{"@type":107,"mainEntity":108},"FAQPage",[109,115,119],{"name":110,"@type":111,"acceptedAnswer":112},"What is the satisfiability problem (SAT) discussed in this chapter?","Question",{"text":113,"@type":114},"SAT asks whether a given propositional logic formula has a satisfying assignment. The chapter emphasizes SAT’s central role in both theoretical computer science and proof search.","Answer",{"name":116,"@type":111,"acceptedAnswer":117},"How does proof complexity relate to SAT solving?",{"text":118,"@type":114},"Proof complexity studies the complexity of proofs and the difficulty of finding them. The chapter uses this perspective to analyze the reasoning capabilities behind modern SAT solvers.",{"name":120,"@type":111,"acceptedAnswer":121},"Why do SAT solvers often succeed on large instances despite theoretical hardness?",{"text":122,"@type":114},"The chapter explains that theoretical worst-case hardness can coexist with practical feasibility: some tiny formulas remain out of reach, while many large SAT instances are derived from easy-but-large underlying problems such as verification tasks.","https://schema.org",{"og:url":83,"og:type":125,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":127,"canonical":83},"index,follow",{"doc_id":129,"site_id":62},267879,1789426007,{"code":4,"msg":5,"data":132},{"doc_id":129,"user_id":133,"nickname":92,"user_avatar":134,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":135,"file_id":136,"file_url":137,"file_type":138,"file_size":139,"view_count":105,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":140,"language":141,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":142,"faqs":143,"seo_title":144,"seo_description":67,"update_tm":130,"read_time":145,"preview_page_count":4},8796095461564,"https://ap-avatar.wpscdn.com/davatar_155a257f0dc6eb9ab79c44ca47cae57d","~~i~~ ~~i~~  \n\\ProofComplexityChapter\" | 2019/7/17 | 15:32 | page 1 | \\#2  \n~~i ~~ ~~ i~~  \nHandbook of Satis􀀌ability 1  \nArmin Biere, Marijn Heule, Hans van Maaren and Toby Walsh IOS Press, 2008  \n􀀍c 2008 Sam Buss and Jakob Nordstr􀁿om. All rights reserved.  \nChapter 1  \nProof Complexity and SAT Solving  \nSam Buss and Jakob Nordstr􀁿om  \nDear reviewers, This is a somewhat rough, but essentially complete, version of the survey chapter. We are now in the process of polishing the write-up and tying up loose ends, but any comments would still be greatly appreciated. { Sam and Jakob  \n1.1. Introduction  \nThe satis􀀌ability problem (SAT) | i.e., to determine whether a given a formula in propositional logic has a satisfying assignment or not | is of central importance to both the theory of computer science and the practice of automatic theorem proving and proof search. Proof complexity | i.e., the study of the complexity of proofs and the di􀀎culty of searching for proofs | joins the theoretic and practical aspects of satis􀀌ability.  \nFor theoretical computer science, SAT is the canonical NP-complete problem, even for conjunctive normal form (CNF) formulas [Coo71, Lev73] . In fact, SAT is very e􀀎cient at expressing problems in NP in that many of the standard NP-complete problems, including the question of whether a Turing machine halts within n steps, have very e􀀎cient, almost linear time, reductions to the satis􀀌 -ability of CNF formulas.1 Furthermore, many theoreticians tend to believe the Strong Exponential Time Hypothesis (SETH), which says that any algorithm for solving CNF SAT must have worst-case running time (roughly) 2n on instances with n variables [IP01, CIP09] . This hypothesis has been widely studied in recent years, and has served as a basis for proving conditional hardness results for many other problems. In other words, CNF SAT serves as the canonical hard decision problem, and is frequently conjectured to require exponential time to solve.  \nIn contrast, for practical theorem proving, CNF SAT is the core method for encoding and solving problems. On one hand, the expressiveness of CNF formulas means that a large variety of problems can be faithfully and straightforwardly translated into CNF SAT problems. On the other hand, the message that SAT  \n1 Formally, these reductions run in quasilinear time, i.e. time n(log n)k for some constant k. For these quasilinear time reductions of the Turing machine halting problem to CNF SAT, see [Sch78, PF79, Rob79, Rob91, Coo88] .  \n~~i ~~ ~~ i~~  \n~~i~~  \n\\ProofComplexityChapter\" | 2019/7/17 | 15:32 | page 2 | \\#3  \n~~i ~~  \n2 Chapter 1 . Proof Complexity and SAT Solving  \nis hard to solve does not seem to have reached practitioners of SAT solving; instead, there has been enormous improvements in performance in SAT algorithms over the last six decade. Amazingly, state-of-the-art algorithms for deciding satis􀀌ability | so-called SAT solvers | can routinely handle real-world instances involving hundreds of thousands or even millions of variables. It is a dramatic development that SAT solvers can often run in (close to) linear time!  \nThus, theoreticians view SAT as being infeasible, while practitioners view it as being (often) feasible. There is no contradiction here. First, it is possible construct tiny formulas with just a few hundred variables that are totally beyond reach for even the best of today's solvers. Conversely, the large instances which are solved by SAT solvers are based on problems which are \\easy\" but very large, for instance arising from software or hardware veri􀀌cation. What is mysterious is why these underlying easy but large problems remain easy after being translated to instances of SAT. Most SAT solvers are general-purpose and written in a very generic way that does not seem to exploit special properties of the underlying problem. Nonetheless, although SAT solvers will sometimes fail miserably, they succeed much more frequently than might be expected. This raises t","cbCaifoFtEy2CBKK","https://ap.wps.com/l/cbCaifoFtEy2CBKK","pdf",946452,106,"English","# Chapter 1\n## Proof Complexity and SAT Solving\n## Introduction","[{\"question\":\"What is the satisfiability problem (SAT) discussed in this chapter?\",\"answer\":\"SAT asks whether a given propositional logic formula has a satisfying assignment. The chapter emphasizes SAT’s central role in both theoretical computer science and proof search.\"},{\"question\":\"How does proof complexity relate to SAT solving?\",\"answer\":\"Proof complexity studies the complexity of proofs and the difficulty of finding them. The chapter uses this perspective to analyze the reasoning capabilities behind modern SAT solvers.\"},{\"question\":\"Why do SAT solvers often succeed on large instances despite theoretical hardness?\",\"answer\":\"The chapter explains that theoretical worst-case hardness can coexist with practical feasibility: some tiny formulas remain out of reach, while many large SAT instances are derived from easy-but-large underlying problems such as verification tasks.\"}]","Handbook of Satis􀀌ability - Chapter 1 - Proof Complexity and SAT Solving | PDF",267]