This paper makes several contributions to Conflict Driven Clauses Learning (CDCL), which is one of the key components of modern SAT solvers. First, we show that, given an implication graph, asserting ...
Abstract: In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning (CDCL) scheme ...
Your task in project 3 is to implement a basic CDCL solver with implication graph analysis, deriving and learning a new clause, which is then used for conflict driven backjumping. In this basic form ...
Add a description, image, and links to the implication-graph topic page so that developers can more easily learn about it.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback