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 1772 for “"SAT"”.
-
Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT
… 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 suite of …
-
SAT and CP
In this thesis, we consider the parallelisation and application of SAT and CP solvers. In the first chapter, we consider SAT, the decision problem of propositional logic. We discuss details of the implementations of SAT solvers, and show how to improve upon existing sequential solvers. Furthermore, …
-
SAT and CP
This thesis is considered with the parallelisation of solvers which search for either an arbitrary, or an optimum, solution to a problem stated in some formal way. We discuss the parallelisation of two solvers, and their application in three chapters.In the first chapter, we consider SAT, the …
-
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 …
-
SAT modulo monotonic theories
Satisfiability Modulo Theories (SMT) solvers are a class of efficient constraint solvers which form integral parts of many algorithms. Over the years, dozens of different Satisfiability Modulo Theories solvers have been developed, supporting dozens of different logics. However, there are still many …
-
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 …
-
SAT-based String Solving
… whether first-order formulas over strings are satisfiable.Because strings are a core data type in nearly every programming language, reliable and efficient solvers are essential in many areas of formal verification. This thesis studies methods for solving string constraints by reducing them to …
-
SAT-based answer set programming
… of a tight program can be found by running a SAT solver on the program's completion, because for such a program answer sets are in a one-to-one correspondence with models of completion. SAT is one of the most widely studied problems in computational logic, and many efficient SAT procedures …
-
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 …
-
The predictability of the SAT
… of overall freshman grade point average and SAT scores to overall junior grade point average and SAT scores. Research has shown that SAT scores have a high correlation with freshman grade point average, but there are conflicting results to the correlations of grade point average beyond the …
-
SAT Solver akcelerovaný pomocí GPU
… se zabývá návrhem a implementací kompletního SAT solveru akcelerovaného na GPU. V první části práce je popsána architektura grafických karet a možnosti platformy CUDA. Následuje popis algoritmů a technik pro řešení problému booleovské splnitelnosti (SAT problému). Je představena zejména rodina …
-
SAT Encodings of Finite CSPs
Boolean satisfiability (SAT) is the problem of determining whether there exists an assignment of the Boolean variables to the truth values such that a given Boolean formula evaluates to true. SAT was the first example of an NP-complete problem. Only two decades ago SAT was mainly considered as of a …
-
Efficient SAT-based answer set solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS are two well-known such systems that work on normal logic programs. They find an answer set from the full models for the …
-
Extending SAT Solver with Parity Reasoning
… conflict-driven clause-learning (CDCL) satisfy ability (SAT) solvers have been successfully applied in a number of industrial domains. In some application areas such as circuit verification, bounded model checking, logical cryptanalysis, and approximate model counting, some requirements …
-
Strategies for SAT-Based Formal Verification
… 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 symbolic …
-
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 …
-
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 …
Page 1 of 89