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 9 of 9 for “"disjunctive normal form"”.
-
On the Learnability of Disjunctive Normal Form Formulas and Decision Trees
The learnability of disjunctive normal form formulas and decision trees is investigated. Polynomial time algorithms are given, and nonlearnability results are obtained, for restricted versions of these general learning problems.
-
Efficiently Learning Monotone Decision Trees with ID3
… functions from random examples drawn from a uniform distribution. In this paper, I take the ID3 information-gain-first classification algorithm and apply it to the task of learning monotone Boolean functions from examples that are uniformly distributed over {0,1}^n. I limited my scope to the …
-
Formulas of first-order logic in distributive normal form
It was shown by Jaakko Hintikka that every formula of first-order logic can be written as a disjunction of formulas called constituents. Such a disjunction is called a distributive normal form of the formula. It is a generalization of the disjunctive normal form for propositional logic. However, …
-
Properties and Behaviours of Fuzzy Cellular Automata
… created from the extension of Boolean rules in disjunctive normal form to continuous functions. Motivated by recent results on the classification of these rules from empirical evidence, we set out first to show that fuzzy cellular automata can shed some light on classical cellular automata and …
-
Functional Encryption as Mediated Obfuscation
… 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 average-case …
-
Functional Encryption as Mediated Obfuscation
… 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 average-case …
-
Conformance preserving data dissemination for large-scale peer to peer systems
… a new pattern of data dissemination based on conformance constraints where data accuracy can be traded for low bandwidth. We formally define the problem of conformance preserving data dissemination and address two types of conformance data dissemination problems that we are interested in: data …
-
Towards Optimal Tree Construction of Monotone Functions
This thesis focuses on finding counterexamples for the conjecture suggested by Dr. Jackson that if two Boolean variables i and j in a monotone Boolean function have the relation such that if i is relevant in only one sub-tree with j as root while j is relevant in both sub-trees with i as root, then …