Search

Skip to Search Results
  • Fall 2011

    Chowdhury, Md Solimul

    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