Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"unit propagation"”.

  1. Prioritized Unit Propagation and Extended Resolution Techniques for SAT Solvers

    … proposing a new heuristic for Boolean Constraint Propagation (BCP), a key component of CDCL SAT solvers, and a novel, extensible, architectural design of an Extended Resolution (ER) SAT solver, a class of solvers that is more powerful than CDCL solvers. The impressive performance of CDCL SAT …

    waterloo Repository record for Prioritized Unit Propagation and Extended Resolution Techniques for SAT Solvers (opens in a new tab)

  2. Extending SAT Solver with Parity Reasoning

    … xor-deduction systems ranging from plain unit propagation through equivalence reasoning to complete incremental Gauss-Jordan elimination are presented. Techniques to analyze xor-deduction system derivations are developed, allowing one to obtain smaller clausal explanations for implied …

    aalto Repository record for Extending SAT Solver with Parity Reasoning (opens in a new tab)

  3. Reusing Work and Avoiding Redundant Work in Propositional Logic Solvers

    … in state-of-the-art solvers, such as repeated propagation steps, finding cores extremely similar to one another, etc. In this thesis, we set out to identify some of this redundant work and then propose methods to eliminate it. Aside from proving our techniques work in theory, we also …

    toronto-retro Repository record for Reusing Work and Avoiding Redundant Work in Propositional Logic Solvers (opens in a new tab)

  4. Using Join Networks to Compute Satisfiability

    … to compute key solver functions, including unit propagation and literal choice. The complexity of computing these functions using join networks becomes dependent upon the size of the truth assignment, or potential model explored at a given search space node. Because models are relatively …

    maryland Repository record for Using Join Networks to Compute Satisfiability (opens in a new tab)

  5. An implementation of the DPLL algorithm

    … for it. We have come up with an idea to make the unit-propagation faster than the known SAT solvers and to maintain the stack of changes efficiently. Our implementation performs well on most instances of the DIMACS benchmarks and it performs better than other SAT-solvers on a certain class of …

    concordia Download PDF for An implementation of the DPLL algorithm (opens in a new tab)

  6. Optimal Planning with Learned Neural Network Transition Models

    … neural networks with Rectified Linear Units (ReLUs), and (ii) Binarized Neural Networks (BNNs). For these learned neural network structures, we provide efficient compilations based on Mixed-Integer Linear Programming (MILP), and Binary Linear Programming (BLP) and Weighted Partial …

    toronto-retro Repository record for Optimal Planning with Learned Neural Network Transition Models (opens in a new tab)