##  [SAT Solving](/index.php/sat-solving) 

  ##  [SAT Solving](https://natural.quantumdictionary.io/sat-solving-0) 

  

 [![Natural & Formal Sciences Dictionary](/sites/default/files/styles/large/public/2026-01/Natural%20%26%20Formal%20Sciences.png.webp?itok=2kCDRVQv)](/index.php/topic-specific-dictionaries/natural-formal-sciences)



**Natural & Formal Sciences Dictionary**

 







 

 

 

 



 

 

 

 

Definition

Algorithms, data structures and procedures for determining whether a propositional Boolean formula (typically in CNF) is satisfiable, and for producing a satisfying assignment when one exists; modern SAT solving includes DPLL, CDCL, heuristics, clause learning, restarts and preprocessing.