Results 241 to 250 of about 510,140 (296)
Some of the next articles are maybe not open access.

Disjunctive normal forms and local exceptions

ACM SIGPLAN Notices, 2003
All classical ?-terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact workings depend on the tautology. Equivalent and more efficient control combinators are described through a specialized sequent calculus and shown to be correct.
Beffara, Emmanuel, Danos, Vincent
openaire   +2 more sources

Completeness and normal form of multi-valued logical functions

Journal of the Franklin Institute, 2020
Theory of completeness is essential for multi-valued logical functions. Using semi-tensor product (STP) of matrices, the algebraic form of k-valued logical functions is presented. Using algebraic form, a method is proposed to construct an adequate set of
D. Cheng, Zequn Liu, Hongsheng Qi
semanticscholar   +1 more source

On the Complexity of Dualization of Monotone Disjunctive Normal Forms

Journal of Algorithms, 1996
Summary: We show that the duality of a pair of monotone disjunctive normal forms of size \(n\) can be tested in \(n^{o(\log n)}\) time.
Fredman, Michael L., Khachiyan, Leonid
openaire   +2 more sources

Construction of Minimal Disjunctive Normal Forms

1969
In this paper we present an algorithm for finding one of the minimal disjunctive normal forms (DNF) for an incompletely specified function of the algebra of logic. A completely specified function can be considered as a special case of an incompletely specified function.
N. A. Gorbovitskaya, I. Sh. Pinsker
openaire   +1 more source

Length of prime disjunctive normal forms

Mathematical Notes of the Academy of Sciences of the USSR, 1967
The author presents an example of a Logical function of n variables that has a prime disjunctive normal form that asymptotically contains 2n terms. Bibliography of 2 references.
openaire   +2 more sources

Minimal Disjunctive Normal Forms

1989
The optimization of Boolean functions is a wide field. One of the few regions where results have achieved a definite appraisal is the minimization of DNFs. Primarily developed for switching circuit synthesis, it has become of some importance also in fault tree analysis (in reliability theory).
openaire   +1 more source

Mapping of reduced disjunctive normal forms onto graphs

Cybernetics, 1980
Summary: The paper deals with the problem of mapping the reduced disjuntive normal forms to finite undirected graphs on the basis of properties of the diagonals of the n-dimensional unit cube subcubes, which correspond to simple implicants of the present Boolean function.
openaire   +1 more source

Probabilistic induction of decision trees and disjunctive normal forms

Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93), 2002
The authors develop a theory for general decision tree induction based on both the logical structure of concepts and the probability distribution of examples. The discrete function is the common analytic representation of decision trees and decision tables (rules). One of the most important classes of discrete functions is the disjunctive normal forms (
X.-J.M. Zhou, T.S. Dillon
openaire   +1 more source

Local algorithms simplifying the disjunctive normal forms of Boolean functions

USSR Computational Mathematics and Mathematical Physics, 1978
Abstract A BRIEF exposition of the theory of local algorithms for simplifying the disjunctive normal forms of Boolean functions is presented. A proof of the essential nature of all the conditions used in the construction of one of the algorithms is presented, and its majorantness is proved.
Kabulov, A. V., Losev, G. F.
openaire   +2 more sources

Duality and pseudo duality of dual disjunctive normal forms

Knowledge-Based Systems, 2011
The paper introduces the concepts of dual disjunctive normal forms in classical logic and fuzzy logics with involution negation. The laws of their truth values are studied. One is called duality, the other is called pseudo duality. Dual disjunctive normal forms in classical logic hold duality, and dual disjunctive normal forms in fuzzy logics with ...
openaire   +1 more source

Home - About - Disclaimer - Privacy