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 14 of 14 for “"SAT Solving"”.
-
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 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 …
-
Automated Verification of Object Petri Nets based on Transformation, Unfoldings and SAT Solving
… actions in some environment in order to satisfy their design objectives. To<br/>this end, several agents communicate and interact in order to solve a complex problem. <br/><br/>With Object Petri nets it is possible to model the mobility and dynamic interactions among agents based on their …
-
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 …
-
Proof theory and algorithms for answer set programming
… search for answer sets are inspired by Boolean Satisfiability (SAT) solving approaches. While the latter have firm proof-theoretic foundations, ASP lacks formal frameworks for characterizing and comparing solving methods. Furthermore, sophisticated search patterns of modern SAT solvers, …
-
Algebraic and Logic Solving Methods for Cryptanalysis
Algebraic solving of polynomial systems and satisfiability of propositional logic formulas are not two completely separate research areas, as it may appear at first sight. In fact, many problems coming from cryptanalysis, such as algebraic fault attacks, can be rephrased as solving a set of Boolean …
-
Design automation for circuit reliability and energy efficiency
… heuristics are used in our approaches such as SAT solving, data mining, logic restructuring, and applied mathematics. Furthermore, the scalability of our approaches was taken into account while we developed our solutions. Experimental results show that our approaches offer the following …
-
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 Boolean …
-
Agent problem solving by inductive and deductive program synthesis
… AI tasks like BlocksWorld. The two systems use SAT solving and other grounded reasoning techniques to solve the examples and generalize the solutions. To prove the abstracted hypotheses, the systems use a novel theorem prover for doing recursive proofs without an explicit induction axiom.
-
Novel RTD-Based Threshold Logic Design and Verification
… speed switching capability and functional versatility. Great circuit functionality can be achieved through integrating heterostructure field-effect transistors (HFETs) in conjunction with RTDs to modulate effective negative differential resistance (NDR). However, RTDs are intrinsically …
-
Exploring Constraint Satisfiability Techniques in Formal Verification
… widespread demands for efficient Propositional Satisfiability (SAT) solvers and its derivatives in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. This dissertation aims to enhance the performance of SAT and related SAT solving …
-
Exploiting SAT and SMT Techniques for Automated Reasoning and Ontology Manipulation in Description Logics
… in Description Logic has become crucial. SAT-based technologies, in the meanwhile, proved to be mature and largely successful in many other automated reasoning fields, first of all on many very hard practical applications of formal verification, often huge characterized by problems of huge …
-
Circuit Design Methods with Emerging Nanotechnologies
… (PLE) is first proposed to explore the versatile functionalities of threshold gates (TGs) and multi-threshold threshold gates (MTTGs). This PLE structure can realize all three- or four-variable logic functions through configuring binary control bits. This is the first single threshold logic …