Results 11 to 20 of about 1,250 (247)
Approximating Boolean Functions with Disjunctive Normal Form
CoRR, 2020 The theorem states that: Every Boolean function can be $ε-approximated$ by a Disjunctive Normal Form (DNF) of size $O_ε(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is generated and proving its correctness.
Yunhao Yang, Andrew Tan
openaire +2 more sources
On Complexity of Standard Forms for Multifunctions
Известия Иркутского государственного университета: Серия "Математика", 2017 Consider discrete functions defined on set A. In this case we define multifunctions as functions on set $2^A$. Values of a multifunction for inputs equal to one-element sets are given and values for other sets are calculated as a union of values on ...
A.S. Kazimirov
doaj +1 more source
Application of Election Functions to Estimate the Number of Monotone Self-Dual Boolean functions
Моделирование и анализ информационных систем, 2022 One of the problems of modern discrete mathematics is R. Dedekind problem on the number of monotone boolean functions. For other precomplete classes, general formulas for the number of functions of the classes had been found, but it has not been found so
Leonid Y. Bystrov, Egor V. Kuzmin
doaj +1 more source
EURO Journal on Computational Optimization, 2018 An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction.
DimitriJ. Papageorgiou +1 more
doaj +1 more source
On the Sensitivity Conjecture for Disjunctive Normal Forms
CoRR, 2016 The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function $f$, the maximum sensitivity $s(f)$, is polynomially related to its block sensitivity $bs(f)$, and hence to other major complexity measures. Despite major advances in the analysis of Boolean functions over the last decade, the problem remains widely open.
Karthik C. S. 0001, Sébastien Tavenas
openaire +4 more sources
Quality measures for fuzzy predicates in conjunctive and disjunctive normal forms
Ingeniería e Investigación, 2014 Association rule mining is a very popular data mining technique. Rules in this technique are often used to identify and represent de-pendencies between attributes in databases.
Taymi Ceruto Cordovés +2 more
doaj +1 more source
Unsupervised DNF Blocking for Efficient Linking of Knowledge Graphs and Tables
Information, 2021 Entity Resolution (ER) is the problem of identifying co-referent entity pairs across datasets, including knowledge graphs (KGs). ER is an important prerequisite in many applied KG search and analytics pipelines, with a typical workflow comprising two ...
Mayank Kejriwal
doaj +1 more source
Information modeling of the normal forms of logical functions in Maple system [PDF]
ITM Web of ConferencesThe article discusses possible ways to use the Maple computer algebra system to obtain perfect conjunctive and disjunctive normal forms. Computer algebra systems make it possible to expand the possibilities for creating, applying and using mathematical ...
Olenev Aleksandr +3 more
doaj +1 more source
Converting ALC Connection Proofs into ALC Sequents [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 The connection method has earned good reputation in the area of automated theorem proving, due to its simplicity, efficiency and rational use of memory. This method has been applied recently in automatic provers that reason over ontologies written in the
Eunice Palmeira +2 more
doaj +1 more source
Context-Aware Explainable Recommendation Based on Domain Knowledge Graph
Big Data and Cognitive Computing, 2022 With the rapid growth of internet data, knowledge graphs (KGs) are considered as efficient form of knowledge representation that captures the semantics of web objects.
Muzamil Hussain Syed +2 more
doaj +1 more source