Skip to search formSkip to main contentSkip to account menu

Disjunctive normal form

Known as: DNF, Full disjunctive normal form, Sum-of-product 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
We present an algorithm, HI-MAT (Hierarchy Induction via Models And Trajectories), that discovers MAXQ task hierarchies by… 
Highly Cited
2003
Highly Cited
2003
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for… 
Highly Cited
2002
Highly Cited
2002
One needs an integrated and sophisticated theory of modals and conditionals for a satisfactory analysis of sentences like (1) and… 
2000
2000
In this paper, we investigate how to represent the behaviour of B abstract systems by finite labelled transition systems (LTS… 
1995
1995
We present two related results about the learnability of disjunctive normal form (DNF) formulas. First we show that a common… 
1988
1988
  • A. Selman
  • 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… 
Highly Cited
1983
Highly Cited
1983
A method for finding the symbolic reliability of a moderately complex system is presented. The method uses Bayesian decomposition…