FAQ

Disjunctive normal form

Known as: Disjunct normal form, 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1956-2017
05101519562016

Related topics

Related topics

30 relations
Admissible ruleAlgebraic normal formAlternating finite automatonAnalysis of algorithms
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Disjunctive normal form
Formal grammar
Clause
Analysis of algorithms
Automated theorem proving
Boolean satisfiability problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Disjunctive normal shape models
A novel implicit parametric shape model is proposed for segmentation and analysis of medical images. Functions representing the… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2013
2013
Privacy-preserving disjunctive normal form operations on distributed sets
Privacy-preserving set operations such as set union and set intersection on distributed sets are widely used in data mining in… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2011
2011
Genotype Phenotype Mapping in Rna Viruses - Disjunctive Normal Form Learning
RNA virus phenotypic changes often result from multiple alternative molecular mechanisms, where each mechanism involves changes… (More)
  • table 3
  • figure 1
  • table 4
  • table 5
  • table 6
Is this relevant?
2010
2010
Finding a short and accurate decision rule in disjunctive normal form by exhaustive search
Greedy approaches suffer from a restricted search space which could lead to suboptimal classifiers in terms of performance and… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2006
2006
Solving QBF with Combined Conjunctive and Disjunctive Normal Form
Similar to most state-of-the-art Boolean Satisfiability (SAT) solvers, all contemporary Quantified Boolean Formula (QBF) solvers… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2003
2003
Efficient dualization of O(log n)-term monotone disjunctive normal forms
This paper shows that O(log n)-term monotone disjunctive normal forms (DNFs) ’ can be dualized in incremental polynomial time… (More)
Is this relevant?
2000
2000
Disjunctive and conjunctive normal forms of pseudo-Boolean functions
After showing that every pseudo-Boolean function (i.e. real-valued function with binary variables) can be represented by a… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Disjunctive Programming: Properties of the Convex Hull of Feasible Points
In this paper we characterize the convex hull of feasible points for a disjunctive program, a class of problems which subsumes… (More)
  • figure I
Is this relevant?
1995
1995
On the Learnability of Disjunctive Normal Form Formulas
We present two related results about the learnability of disjunctive normal form (DNF) formulas. First we show that a common… (More)
Is this relevant?
1987
1987
An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments
We present an approach to processing logic queries in loosely coupled environments. We emphasize the importance of the loose… (More)
  • figure 6
  • figure 14
Is this relevant?