Search
Skip to Search Results
Filter
Subject / Keyword
Departments
Author / Creator / Contributor
Year
Collections
Languages
Item type
Supervisors
-
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 - 1 of 1