Skip to Main Content

Search

Skip to Search Results
Filter
Close
Author / Creator / Contributor
Departments
Languages
Collections
Subject / Keyword
Year
to
Item type
Supervisors
Author: Chowdhury, Md Solimul Departments: Department of Computing Science Languages: English Collections: Graduate and Postdoctoral Studies (GPS), Faculty of /Theses and Dissertations

  • Empirical Insights Driven CDCL SAT Algorithms

    Download

    Spring 2022

    Chowdhury, Md Solimul

    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...

  • SAT with Global Constraints

    Download

    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 - 2 of 2