Negation normal form

Known as: NNF, Negational normal form, Normal form 
In mathematical logic, a formula is in negation normal form if the negation operator (, not) is only applied to variables and the only other allowed… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Various problems in artificial intelligence can be solved by translating them into a quantified boolean formula (QBF) and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Subsets of the Negation Normal Form formulas (NNFs) of propositional logic have received much attention in AI and proved as… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We describe a new algorithm for compiling conjunctive normal form (CNF) into Deterministic Decomposable Negation Normal (d-DNNF… (More)
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2004
2004
Proving completeness ofNC-resolution under a linear restriction has been elusive; it is proved here for formulas in negation… (More)
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
2003
2003
Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present a compiler for converting CNF formulas into deterministic, decomposable negation normal form (d-DNNF). This is a… (More)
  • figure 1
  • figure 3
  • table 1
  • figure 4
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Knowledge compilation has been emerging recently as a new direction of research for dealing with the computational intractability… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
We propose a method for compiling proposit ional theories into a new tractable form that we refer to as decomposable negation… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 8
Is this relevant?
1997
1997
Completeness proofs that generalize the Anderson-Bledsoe excess literal argument are developed for calculi other than resolution… (More)
Is this relevant?