Results 1 to 10 of about 8,135,111 (272)

Perfect disjunctive normal forms of algebra U2

open access: yesНауковий вісник Ужгородського університету. Серія: Математика і інформатика, 2018
The complete identities system of algebra U2 have been constructed in the paper. On the basis of the complete identities system an algorithm for constructing the perfect disjunctive normal form is developed.
І. А. Мич   +2 more
doaj   +5 more sources

Disjunctive form and the modal μ alternation hierarchy [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2015
This paper studies the relationship between disjunctive form, a syntactic normal form for the modal mu calculus, and the alternation hierarchy. First it shows that all disjunctive formulas which have equivalent tableau have the same syntactic alternation
Karoliina Lehtinen
doaj   +3 more sources

Same Effect Relation and Concept Reduction in Formal Concept Analysis [PDF]

open access: yesJisuanji kexue, 2023
Since 2018,scholars have proposed and studied a new topic of “concept reduction” in formal concept analysis.Including unnecessary concepts,core concepts,relatively necessary concepts,and the identification of three types of concepts,and research on ...
MA Wensheng, HOU Xilin
doaj   +1 more source

On the Learnability of Disjunctive Normal Form Formulas [PDF]

open access: yesMachine Learning, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Howard Aizenstein, Leonard Pitt
openaire   +4 more sources

Determination of Significant Parameters on the Basis of Methods of Mathematical Statistics, and Boolean and Fuzzy Logic

open access: yesMathematics, 2022
Among the set of parameters for which data are collected for decision-making based on artificial intelligence methods, often only some of the parameters are significant.
Yulia Shichkina   +2 more
doaj   +1 more source

Logical minimization for combinatorial structure in FPGA

open access: yesInformatika, 2021
The paper describes the research results of application efficiency of minimization programs of functional descriptions of combinatorial logic blocks, which are included in digital devices projects that are implemented in FPGA.
P. N. Bibilo   +2 more
doaj   +1 more source

The search for subsystems of related functions from multilevel representation of systems of Boolean functions1

open access: yesInformatika, 2020
One of the directions of logical optimization of multilevel representations of systems of Boolean     functions is the methods based on the search of subsystems of functions that have the same parts in the domains of functions of selected subsystems ...
P. N. Bibilo, A. M. Pazniak
doaj   +1 more source

Minimization of binary decision diagrams for systems of completely defined Boolean functions using Shannon expansions and algebraic representations of cofactors

open access: yesInformatika, 2021
In the systems of digital VLSI design (Very Large Integrated Circuits), the BDD (Binary Decision Diagram) is used for VLSI verification, as well as for technologically independent optimization as the first stage in the synthesis of logic circuits in ...
P. N. Bibilo, V. I. Romanov
doaj   +1 more source

Approximating Boolean Functions with Disjunctive Normal Form

open access: yesCoRR, 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

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 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

Home - About - Disclaimer - Privacy