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 20 of 95 for “"SAT solvers"”.

  1. Hardware-Accelerated SAT Solvers

    We present a hardware-accelerated Boolean Satisfiability Problem (SAT) solver targeting processor/Field-Programmable Gate Array (FPGA) System on Chip (SoC)s. Our solution accelerates the most expensive subroutine of the Davis-Putnam-Logemann-Loveland (DPLL) algorithm, Boolean Constrain Propagation …

    carleton Repository record for Hardware-Accelerated SAT Solvers (opens in a new tab)

  2. Machine Learning for SAT Solvers

    Boolean SAT solvers are indispensable tools in a variety of domains in computer science and engineering where efficient search is required. Not only does this relieve the burden on the users of implementing their own search algorithm, they also leverage the surprising effectiveness of modern SAT …

    waterloo Repository record for Machine Learning for SAT Solvers (opens in a new tab)

  3. Understanding and Enhancing CDCL-based SAT Solvers

    … conflict-driven clause-learning (CDCL) Boolean satisfiability (SAT) solvers routinely solve formulas from industrial domains with millions of variables and clauses, despite the Boolean satisfiability problem being NP-complete and widely regarded as intractable in general. At the same time, very …

    waterloo Repository record for Understanding and Enhancing CDCL-based SAT Solvers (opens in a new tab)

  4. Towards Next Generation Sequential and Parallel SAT Solvers

    This thesis focuses on improving the SAT solving technology. The improvements focus on two major subjects: sequential SAT solving and parallel SAT solving. To better understand sequential SAT algorithms, the abstract reduction system Generic CDCL is introduced. With Generic CDCL, the soundness of …

    qucosa-diss

  5. SATenstein : automatically building local search SAT solvers from components

    Designing high-performance solvers for computationally hard problems is a difficult and often time-consuming task. It is often the case that a new solver is created by augmenting an existing algorithm with a mechanism found in a different algorithm or by combining components from different …

    ubc Repository record for SATenstein : automatically building local search SAT solvers from components (opens in a new tab) Download PDF for SATenstein : automatically building local search SAT solvers from components (opens in a new tab)

  6. Parallel SAT solvers and their application in automatic parallelization

    … programming. We present here two proposals: SAT-PaDdlinG and RePaSAT. SAT-PaDdlinG is a parallel DPLL SAT Solver on GPU, which allows RePaSAT to use this environment. RePaSAT is our proposal of a parallel machine that uses the SAT Problem to automatically parallelize sequential code. Because …

    brazil-ufrgs Repository record for Parallel SAT solvers and their application in automatic parallelization (opens in a new tab)

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

    NP-complete problems like the Boolean Satisfiability (SAT) Problem are ubiquitous in computer science, mathematics, and engineering. Consequently, researchers have developed algorithms such as Conflict-Driven Clause-Learning (CDCL) SAT solvers, aimed at determining the satisfiability of Boolean …

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

  8. CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis

    … of conflict-driven clause-learning Boolean satisfiability (CDCL SAT) solvers over industrial problems from a variety of applications such as verification, testing, security, and AI. The availability of such powerful general-purpose search tools as the SAT solver has led many researchers to …

    waterloo Repository record for CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis (opens in a new tab)

  9. Understanding and Improving SAT Solvers via Proof Complexity and Reinforcement Learning

    Despite the fact that the Boolean satisfiability (SAT) problem is NP-complete and believed to be intractable, SAT solvers are routinely used by practitioners to solve hard problems in wide variety of fields such as software engineering, formal methods, security, and AI. This gap between theory and …

    waterloo Repository record for Understanding and Improving SAT Solvers via Proof Complexity and Reinforcement Learning (opens in a new tab)

  10. Towards a Theoretical Understanding of the Power of Restart in SAT solvers

    … of conflict-driven clause-learning (CDCL) SAT solvers. While the utility of such policies has been well-established, to-date we still lack a deep theoretical understanding of why restart policies are crucial to the power of CDCL SAT solvers. In this paper, we provide a series of results …

    waterloo Repository record for Towards a Theoretical Understanding of the Power of Restart in SAT solvers (opens in a new tab)

  11. The Impact of Boolean Satisfiability Problem Structure on Graph Neural Network Performance

    Boolean Satisfiability (SAT) is a fundamental problem in the study of computational complexity, particularly in understanding the complexity class of NP problems. Over the years, Graph Neural Networks (GNNs) have achieved significant advancements in domains such as graphics and image processing. …

    unsw Repository record for The Impact of Boolean Satisfiability Problem Structure on Graph Neural Network Performance (opens in a new tab)

  12. Efficient satisfiability solver

    … saw great improvements in the performance of satisfiability (SAT) solvers. In this thesis, we discuss the state-of-the-art techniques used in building an efficient SAT solver. Modern SAT solvers are mainly constituted by the following components: decision heuristics, Boolean constraint …

    iastate Repository record for Efficient satisfiability solver (opens in a new tab)

  13. Solving Hybrid Boolean Constraints by Fourier Expansions and Continuous Optimization

    The Boolean SATisfiability problem (SAT) is of central importance in computer science. Although SAT is known to be NP-complete, progress on the engineering side---especially that of Conflict-Driven Clause Learning (CDCL) and Local Search SAT solvers---has been remarkable. Yet, while SAT solvers, …

    rice Repository record for Solving Hybrid Boolean Constraints by Fourier Expansions and Continuous Optimization (opens in a new tab)

  14. Puzzle Solving with Proof

    The development of SAT solvers is an ongoing research area, driven by the possibility to use SAT solvers to solve a wide range of problems. This development has made SAT solvers fast, and they solve increasingly more difficult problems. In order to take advantage of this development, the encoding …

    chalmers Repository record for Puzzle Solving with Proof (opens in a new tab)

  15. Performance understanding and tuning of iterative computation using profiling techniques

    … algorithmic state by applying it to the SAT Solvers and program state by applying it to a variety of benchmarks exhibiting completely parallelizable loops. Further, we show that such a performance characterization can be successfully used to improve the performance of the underlying …

    gatech Repository record for Performance understanding and tuning of iterative computation using profiling techniques (opens in a new tab)

  16. Algorithmic applications of propositional proof complexity

    … practical side, we concentrate on propositional satisfiability algorithms (SAT solvers) which form the core of numerous real-world automated reasoning systems.There are three major contributions in this work. (A) We study the behavior of resolution on appropriate encodings of three graphs …

    washington Repository record for Algorithmic applications of propositional proof complexity (opens in a new tab)

  17. Efficient Reasoning Techniques for Large Scale Feature Models

    … have significant appeal for researchers: SAT solvers and Binary Decision Diagrams (BDDs). Each technique has been applied successfully for over four decades now to tackle many practical combinatorial problems in various domains. Currently, several approaches have proposed the compilation …

    waterloo Repository record for Efficient Reasoning Techniques for Large Scale Feature Models (opens in a new tab)

  18. Structure-based satisfiability checking : analyzing and harnessing the potential

    Constraint satisfaction deals with developing automated techniques for solving computationally hard problems in a declarative fashion. The main emphasis of this thesis is on constraint satisfaction techniques for the propositional satisfiability problem (SAT). As solving techniques for …

    aalto Repository record for Structure-based satisfiability checking : analyzing and harnessing the potential (opens in a new tab)

  19. Incremental Satisfiability Solving and its Applications

    The propositional logic satisfiability problem (SAT) is a computationally hard decision problem. Despite its theoretical hardness, decision procedures for solving instances of this problem have become surprisingly efficient in recent years. These procedures, known as SAT solvers, are able to solve …

    aalto Repository record for Incremental Satisfiability Solving and its Applications (opens in a new tab)

Page 1 of 5