Results 211 to 220 of about 1,250 (247)

Ordered model trees: A normal form for disjunctive deductive databases

Journal of Automated Reasoning, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adnan Yahya, Jack Minker, Minker Jack
exaly   +3 more sources

Shortest and minimal disjunctive normal forms of complete functions

Computational Mathematics and Mathematical Physics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +2 more sources

Disjunctive Normal Form

2017
Pfahringer Bernhard
exaly   +2 more sources

Symbolic minimization of disjunctive normal forms

Computational Mathematics and Modeling, 1993
M. V. Mikhailyuk, N. G. Sedrakyan
exaly   +2 more sources

Disjunctive Normal Form

2011
exaly   +2 more sources

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.
Michael L. Fredman, Leonid Khachiyan
openaire   +2 more sources

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

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 (
Xiao-Jia M. Zhou, Tharam S. Dillon
openaire   +1 more source

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

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