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 15 of 15 for “"Conjunctive normal form"”.
-
Satisfiability Advancements Enabled by State Machines
… that retain more ungarbled user- domain information than other more common representations such as Conjunctive Normal Form (CNF). State-base SAT also supports earlier inference deduction during search, the use of powerful search heuristics, and the integration of special purpose constraints …
-
Tri-State Boolean Satisfiability with Commit: An Efficient Partial Solution Using Hyperlogic
… We modified the semantics of the classic 3 Conjunctive Normal Form Problem in order to develop a polynomial time algorithm for a simplified normal form - avoiding the need to examine all combinatoric limitations. In particular, we abandoned 3 CNF and used an unstructured left to right …
-
Finding bugs in software with a constraint solver
… on a three-step translation: from code to a formula in Alloy, which is a first-order relational logic, then to a propositional formula, and finally to conjunctive normal form. An off-the-shelf SAT solver is then used to find a solution that constitutes a counterexample. Modularity comes at …
-
Thresholds and Symmetries in Propositional Formulas
… concerning the satisfiability of propositional formulas are investigated. With respect to the first problem, there is great experimental evidence for a phenomenon known as the 'phase transition' of satisfiability, that is there is a sharp threshold, in the limit, between satisfiable and …
-
Functional Encryption as Mediated Obfuscation
… and a general feasibility result for obfuscating conjunctive normal form and disjunctive normal form formulae (under a weaker “semantic” notion of security). Finally, we use mediated obfuscation to illustrate a connection between worst-case and average-case static obfuscation. In short, an …
-
Functional Encryption as Mediated Obfuscation
… and a general feasibility result for obfuscating conjunctive normal form and disjunctive normal form formulae (under a weaker “semantic” notion of security). Finally, we use mediated obfuscation to illustrate a connection between worst-case and average-case static obfuscation. In short, an …
-
Solving Hybrid Boolean SAT by Continuous Optimization
… aimed at solving industrial-scale benchmarks in Conjunctive Normal Form (CNF), have become quite mature, other types of non-CNF, i.e., hybrid constraints (e.g., cardinality/pseudo-Boolean constraints and XOR}s play important roles in critical applications such as cryptography, task scheduling, …
-
SAT Solving Using XOR-OR-AND Normal Forms and Cryptographic Fault Attacks
… SAT solving by introducing the XOR-OR-AND normal form (XNF) as a generalization of the conjunctive normal form (CNF), where literals are replaced by XOR chains of literals. This allows for a native representation of XOR constraints. We generalize the CDCL architecture to the richer language …
-
Novel RTD-Based Threshold Logic Design and Verification
… insightful view of design tradeoffs between performance and area. We present the mathematical proof of PLE's logic completeness based on Shannon Expansion, as well as the HSPICE simulation results of the programmable and primitive RTD/HFET gates that we have designed. An efficient control bit …
-
Symbolic Approaches for Boolean Synthesis
… variables in a given specification in Boolean formula as a conjunction of constraints describing the relationship over known and unknown variables. Formally, the problem consists of two parts, the identification of full, partial, and nullary realizability for the input domain, and the …
-
Graph Neural Networks: Techniques and Applications
Effective information analysis generally boils down to the geometry of the data represented by a graph. Typical applications include social networks, transportation networks, the spread of epidemic disease, brain's neuronal networks, gene data on biological regulatory networks, telecommunication …
-
Parameterized Relaxations for Circuits and Graphs
… a task related to counting solutions to Boolean formulas in conjunctive normal form (i.e., CNF formulas), which has been extensively studied in areas related to probabilistic planning and inference. It has been known since the problem’s introduction in the 1970s that Majority-SAT is complete for …
-
Algebraic and Logic Solving Methods for Cryptanalysis
… 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 polynomials or as deciding the …
-
Towards Reliable AI via Efficient Verification of Binarized Neural Networks
… success on many tasks and even surpass human performance in certain settings. Despite this success, neural networks are known to be vulnerable to the problem of adversarial inputs, where small and human- imperceptible changes in the input cause large and unexpected changes in the output. This …
-
Circuit Design Methods with Emerging Nanotechnologies
… to achieve magnitude improvement in performance and integration density. The substitution of CMOS transistors with nano-devices is expected to not only continue along the exponential projection of Moore's Law, but also raise significant challenges and opportunities, especially in the …