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 112 for “"Boolean satisfiability"”.

  1. Sampling Techniques for Boolean Satisfiability

    Boolean satisfiability (SAT) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the classical problem of checking boolean satisfiability, the problems of generating satisfying uniformly at random, and of …

    rice Repository record for Sampling Techniques for Boolean Satisfiability (opens in a new tab)

  2. Exploits in Concurrency for Boolean Satisfiability

    Boolean Satisfiability (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is NP-complete, advanced solver algorithms and heuristics allow for fast solutions to many large industrial …

    vt Repository record for Exploits in Concurrency for Boolean Satisfiability (opens in a new tab)

  3. Several Issues on the Boolean Satisfiability (SAT) Problem

    Boolean Satisfiability (SAT) is often used as the model for a significant and increasing number of applications in Electronics Design Automation (EDA) and many other fields of computer science and engineering. Although the SAT problem belongs to the class NP-complete - problems that do not have a …

    maryland Repository record for Several Issues on the Boolean Satisfiability (SAT) Problem (opens in a new tab)

  4. Machine learning for structural reasoning in Boolean Satisfiability

    … of machine learning and propositional Boolean Satisfiability (SAT) offers transformative possibilities for solving some of the most challenging computational problems. This thesis investigates the use of modern machine learning (ML) and deep learning (DL) methodologies to enhance …

    cork Repository record for Machine learning for structural reasoning in Boolean Satisfiability (opens in a new tab)

  5. Efficient Path Delay Test Generation with Boolean Satisfiability

    … efficiency of path delay test generation using a Boolean satisfiability (SAT) solver. As part of this research, one of the most commonly used SAT solvers, MiniSat, was integrated into the path delay test generator CodGen. A mixed structural-functional approach was implemented in CodGen where …

    tamu Repository record for Efficient Path Delay Test Generation with Boolean Satisfiability (opens in a new tab)

  6. Dataless Neural Networks for Boolean Satisfiability and Network Optimization

    … in combinatorial optimization (including satisfiability and network design) are NP-hard. Traditionally, researchers have built approximate solvers that return near- optimal solutions efficiently by developing increasingly sophisticated heuristics and meta- heuristics. Deep learning has …

    wvu Repository record for Dataless Neural Networks for Boolean Satisfiability and Network Optimization (opens in a new tab)

  7. On the bridge between constraint satisfaction and Boolean satisfiability

    … in propositional logic, or, in other words, a Boolean satisfiability problem (SAT). In the quest to find efficient algorithms for solving instances of CSP and SAT specialised software has been developed. It is, however, not clear when should we choose a SAT-solver over a constraint solver (and …

    oxford Repository record for On the bridge between constraint satisfaction and Boolean satisfiability (opens in a new tab)

  8. Hybrid solvers for the Boolean Satisfiability problem: an exploration

    The Boolean Satisfiability problem (SAT) is one of the most extensively researched NP-complete problems in Computer Science. This thesis focuses on the design of feasible solvers for this problem. A SAT problem instance is a formula in propositional logic. A SAT solver attempts to find a solution …

    rowan Repository record for Hybrid solvers for the Boolean Satisfiability problem: an exploration (opens in a new tab)

  9. Redundancy identification and parallel test generation using boolean satisfiability

    … redundant faults directly by deciding the satisfiability problem for a boolean difference formula in the conjunctive normal form. The algorithm is based on a system of five reduction rules which form a complete rule system. Experimental results on the benchmark circuits show that the number …

    nebraska Repository record for Redundancy identification and parallel test generation using boolean satisfiability (opens in a new tab)

  10. Quantum Speed-ups for Boolean Satisfiability and Derivative-Free Optimization

    … we have considered two important problems, Boolean satisfiability (SAT) and derivative free optimization in the context of large scale quantum computers. In the first part, we survey well known classical techniques for solving satisfiability. We compute the approximate time it would take to …

    waterloo Repository record for Quantum Speed-ups for Boolean Satisfiability and Derivative-Free Optimization (opens in a new tab)

  11. Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability

    Boolean Satisfiability (SAT) is a fundamental NP-complete problem of determining whether there exists an assignment of variables which makes a Boolean formula evaluate to True. SAT is a convenient representation for many naturally occurring optimization and decisions problems such as planning and …

    waterloo Repository record for Novel Value Ordering Heuristics Using Non-Linear Optimization In Boolean Satisfiability (opens in a new tab)

  12. Exploiting Boolean Satisfiability Solvers for High Performance Bit-Level Model Checking

    … is scalability. Recent performance advances in Boolean Satisfiability (SAT) solvers, brought about a leap in the scalability of those techniques. SAT-based model checking algorithms, however, still suffer from non-negligible applicability issues when confronted with the complexity of many …

    poli-torino Repository record for Exploiting Boolean Satisfiability Solvers for High Performance Bit-Level Model Checking (opens in a new tab)

  13. Tri-State Boolean Satisfiability with Commit: An Efficient Partial Solution Using Hyperlogic

    … present two implementation enhancements for the Boolean satisfiability problem and one visualization technique. The first is an expansion to a tri-nary logic system with a commit phase. The three states are (1) true, (2) false, and (3) don't care. We abstracted the operations of AND and OR to …

    usm Repository record for Tri-State Boolean Satisfiability with Commit: An Efficient Partial Solution Using Hyperlogic (opens in a new tab)

  14. Algorithms and data structures for logic synthesis and verification using Boolean satisfiability

    Boolean satisfiability (SAT) was the first problem to be proven to be NP-Complete. The proof, provided by Stephen Cook in 1971, demonstrated that inputs accepted by a non-deterministic Turing machine can be described by satisfying assignments of a Boolean formula. The reduction to SAT feels natural …

    umn Repository record for Algorithms and data structures for logic synthesis and verification using Boolean satisfiability (opens in a new tab)

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

  16. A Study of Spin Glasses and Their Applications

    … theme of this dissertation is the study of the Boolean satisfiability problem through the use of Ising spin form. The Boolean satisfiability problem is the problem of determining if there exists an assignment of Boolean variables that satisfies a given Boolean formula. Considering that there are …

    tamu Repository record for A Study of Spin Glasses and Their Applications (opens in a new tab)

  17. An Analysis of the Effect of Community Structure on SAT Solver Performance

    Despite enormous improvements in Boolean SATisfiability solver performance over the last decade, it is still unclear why specific input formula are slow to solve, when other similarly specified formula execute more quickly. This work explores the relationship between the community structure of a …

    waterloo Repository record for An Analysis of the Effect of Community Structure on SAT Solver Performance (opens in a new tab)

  18. Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT

    … languages from AI: Constraint Programing (CP), Boolean Satisfiability (SAT), and Maximum Satisfiability (MAX-SAT). We then use solvers to find optimal solutions to this problem. We show which of these solvers is more efficient when finding optimal solutions. For this purpose, we create a test …

    denver Repository record for Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT (opens in a new tab)

  19. Learning symbolic abstractions from system execution traces

    … system execution traces using a combination of Boolean satisfiability and program synthesis. In addition, the degree of completeness of an inferred abstraction can be evaluated by employing equivalence checking using simulation relations, that can further be used to iteratively infer an …

    oxford Repository record for Learning symbolic abstractions from system execution traces (opens in a new tab)

Page 1 of 6