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 34 for “"boolean satisfiability"”.
-
Characterizing Boolean satisfiability variants
We survey variants of the Boolean Satisfiability problem from over the years and organize them in what we believe to be the most comprehensive list of known results in SAT variants. We propose a new notation to specify them so that the problems can be compared with no ambiguities, and so that new …
-
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 …
-
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 …
-
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 …
-
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 …
-
A Novel Approach to White-Box Policy Analysis
… via a reduction to either propositional satisfiability or pseudo boolean satisfiability instances, after which standard solvers can be invoked to complete the evaluation. Empirical analyses have been conducted to compare the relative efficiency of the SAT and PBS encodings. The latter is …
-
Diagnose network failures via data-plane analysis
… translates high-level network invariants into boolean satisfiability problems, checks them against network state using a SAT solver, and reports counterexamples if violations have been found. Applied to a large campus network, Anteater revealed 23 bugs, including forwarding loops and stale ACL …
-
Distributed SAT solving engine
The boolean satisfiability problem (SAT) is one of the typical NP-complete problems that have found considerable industrial applications in the past decades. Significant theoretical and practical efforts has been devoted to the research in this particular problem. Recently, with the major …
-
Optimizing Quantum Circuit Layout using Quantum Annealing
… implements local qubit line reordering using Boolean satisfiability theory. As our problem-solving tool, we use Quantum Annealing, leveraging its capabilities as a quantum heuristic optimization solver. Our numerical experiments, conducted with several benchmark quantum circuits, demonstrate …
-
A constraint solver for software engineering : finding models and cores of large relational specifications
… works by translating a relational problem to a boolean satisfiability problem; applying an off-the-shelf SAT solver to the resulting formula; and converting the SAT solver's output back to the relational domain. The idea of solving relational problems by reduction to SAT is not new. The core …
-
New strategies for electronic design automation problems
… routing problem. Our first strategy is to use Boolean satisfiability to optimally solve the escape routing problem on one PCB component. Our second strategy is to use a novel boundary routing methodology to finish escape routing from two connected PCB components simultaneously. This router can …
-
Graphical structure of unsatisfiable boolean formulae
… classical logic and computer science problem of boolean satisfiability k-SAT. k-SAT asks if there exists a truth assignment that satisfies a given boolean formula. Our variant deals with multi-hypergraphs instead of boolean formulae and uses truth assignments on vertices instead of variables. …
-
Optimism and Robustness: Learning From Structured and Semi-Random Inputs
… (structured inputs). In Chapter 2, we study the Boolean satisfiability problem (SAT) in the framework of learning-augmented algorithms, where the problem instance is provided with a prediction that contains partial information of an optimal solution. We study both the decision and optimization …
-
RELAY-ASSISTED HYBRID FIBER/MMWAVE-WIRELESS BACKHAUL NETWORK
… problem and then transform the problem into a Boolean satisfiability problem. Different methods have been used and compared to solve this problem. Lastly, we focus on the load-balanced routing problem in our hybrid backhaul networks with grid topology. In hybrid backhaul architecture where some …
-
Solving Hybrid Boolean SAT by Continuous Optimization
The Boolean SATisfiability problem (SAT) is of central importance in computer science. Despite the NP-completeness of SAT, 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, aimed at …
-
Methodologies for Test and Diagnosis of Delay Defects in Integrated Circuits
… proposed formulation can be transformed into a Boolean Satisfiability form to be solved by any SAT solver. The approach is capable of providing a small number of alternative sets of defective segments. One of the solutions is the actual defect configuration. This is shown to be a very important …
-
SAT Solving Using XOR-OR-AND Normal Forms and Cryptographic Fault Attacks
The Boolean satisfiability problem (SAT) lies at the core of computational logic and has found many applications in verification, cryptography, and artificial intelligence. While conflict-driven SAT solvers (CDCL) excel on large industrial instances, they struggle with XOR-rich instances arising …
-
Monitoring and verifying network behavior using data-plane state
… a network's data-plane state and invariants into boolean satisfiability problems, and checks them using a SAT solver. Our second tool, called VeriFlow, creates a device independent graph model of the network state, and uses standard graph traversal algorithms to detect invariant violations. We …
-
Strategies for SAT-Based Formal Verification
… otherwise. In this dissertation, we focus on Boolean Satisfiability (SAT) based formal verification, which has gained tremendous importance in the recent past. Importantly, SAT-based approaches often alleviate the memory explosion problem, which had been a bottleneck of the traditional …
-
SMT-based bounded model checking of multi-threaded software in embedded systems
… using bounded model checking (BMC) based on Satisfiability Modulo Theories (SMT) techniques. We present three major novel contributions. First, we extend the encodings from previous SMT-based bounded model checkers to provide more accurate support for variables of finite bit width, bit-vector …
Page 1 of 2