Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,086,139 papers from all fields of science
Search
Sign In
Create Free Account
Disjunctive normal form
Known as:
DNF
, Full disjunctive normal form
, Sum-of-product
Expand
A logical formula is considered to be in DNF if and only if it is a disjunction of one or more conjunctions of one or more literals. A DNF formula is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
Admissible rule
Algebraic normal form
Alternating finite automaton
Analysis of algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets
T. Hamrouni
,
S. Yahia
,
E. Nguifo
Data & Knowledge Engineering
2009
Corpus ID: 15002773
Highly Cited
2008
Highly Cited
2008
Automatic discovery and transfer of MAXQ hierarchies
N. Mehta
,
Soumya Ray
,
Prasad Tadepalli
,
Thomas G. Dietterich
International Conference on Machine Learning
2008
Corpus ID: 9038318
We present an algorithm, HI-MAT (Hierarchy Induction via Models And Trajectories), that discovers MAXQ task hierarchies by…
Expand
Highly Cited
2003
Highly Cited
2003
Multiple-Instance Learning via Disjunctive Programming Boosting
Stuart Andrews
,
Thomas Hofmann
Neural Information Processing Systems
2003
Corpus ID: 8764624
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for…
Expand
Highly Cited
2002
Highly Cited
2002
Necessary Conditions in a Natural Language
K. Sæbø
2002
Corpus ID: 123985911
One needs an integrated and sophisticated theory of modals and conditionals for a satisfactory analysis of sentences like (1) and…
Expand
2000
2000
Construction of Finite Labelled Transistion Systems from B Abstract Systems
Didier Bert
,
F. Cave
International Conference on Integrated Formal…
2000
Corpus ID: 43603208
In this paper, we investigate how to represent the behaviour of B abstract systems by finite labelled transition systems (LTS…
Expand
1995
1995
On the Learnability of Disjunctive Normal Form Formulas
H. Aizenstein
Machine-mediated learning
1995
Corpus ID: 24261585
We present two related results about the learnability of disjunctive normal form (DNF) formulas. First we show that a common…
Expand
1988
1988
Natural Self-Reducible Sets
A. Selman
SIAM journal on computing (Print)
1988
Corpus ID: 38806645
To every set A in NP we associate a (collection of) natural self-reducible set${\operatorname{set}}(s)$. We prove that every…
Expand
1987
1987
Improved variable-entered Karnaugh map procedures
A. Rushdi
1987
Corpus ID: 62571119
Highly Cited
1985
Highly Cited
1985
Discovering Patterns in Sequences of Events
Thomas G. Dietterich
,
R. Michalski
Artificial Intelligence
1985
Corpus ID: 10560392
Highly Cited
1983
Highly Cited
1983
Symbolic Reliability Analysis with the Aid of Variable-Entered Karnaugh Maps
A. Rushdi
IEEE Transactions on Reliability
1983
Corpus ID: 20213950
A method for finding the symbolic reliability of a moderately complex system is presented. The method uses Bayesian decomposition…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE