Search
Skip to Search Results
Filter
Author / Creator / Contributor
Subject / Keyword
- 1Automated Reasoning
- 1Conflict Directed Clause Learning (CDCL) SAT
- 1Constraint Programming
- 1Decision Problem
- 1Decision/Branching Heuristic
- 1Global Constraints
Year
Collections
Languages
Item type
Departments
-
Spring 2022
Boolean Satisfiability (SAT) is a well-known NP-complete problem. Despite the theoretical hardness of SAT, backtracking search based Conflict Directed ClauseLearning (CDCL) SAT solvers can solve very large real-world SAT instances with surprising efficiency. The high efficiency of CDCL SAT...
-
Fall 2011
Propositional satisability (SAT) has been a dominant tool in solving some practical NP-complete problems. However, SAT also has a number of weaknesses, including its inability to compactly represent numerical constraints and its low level, unstructured language of clauses. In contrast, Constraint...
1 - 2 of 2