Results 11 to 20 of about 510,140 (296)
Disjunctive bases: normal forms and model theory for modal logics [PDF]
Logical Methods in Computer Science, 2022 We present the concept of a disjunctive basis as a generic framework for normal forms in modal logic based on coalgebra. Disjunctive bases were defined in previous work on completeness for modal fixpoint logics, where they played a central role in the proof of a generic completeness theorem for coalgebraic mu-calculi.
Enqvist, S., Venema, Y.
openaire +7 more sources
Finding a short and accurate decision rule in disjunctive normal form by exhaustive search [PDF]
Machine-mediated learning, 2010 Greedy approaches suffer from a restricted search space which could lead to suboptimal classifiers in terms of performance and classifier size. This study discusses exhaustive search as an alternative to greedy search for learning short and accurate ...
P. Rijnbeek, J. Kors
semanticscholar +4 more sources
Mathematics, 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
Informatika, 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
Informatika, 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
Informatika, 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 Boolean functions in the class of orthogonal disjunctive normal forms
Informatika, 2021 The orthogonal disjunctive normal forms (DNFs) of Boolean functions have wide applications in the logical design of discrete devices. The problem of DNF orthogonalization is to get for a given function such a DNF that any two its terms would be ...
Yu. V. Pottosin
doaj +1 more source
Generalized Connectives for Multiplicative Linear Logic [PDF]
, 2020 In this paper we investigate the notion of generalized connective for multiplicative linear logic. We introduce a notion of orthogonality for partitions of a finite set and we study the family of connectives which can be described by two orthogonal sets ...
Acclavio, Matteo, Maieli, Roberto
core +3 more sources
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
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