Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
As a key component in many computer vision systems, optical flow estimation, especially with large displacements, remains an open… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We introduce JumpCut, a new mask transfer and interpolation method for interactive video cutout. Given a source frame for which a… Expand
  • figure 2
  • figure 3
  • figure 4
  • table 1
  • 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… Expand
Is this relevant?
2006
2006
Most state-of-the-art SAT solvers are based on DPLL search and require the input formula to be in clausal form (cnf). However… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
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… Expand
  • figure 1
  • figure 2
  • table 2
  • table 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We propose a method for compiling propositional theories into a new tractable form that we refer to as decomposable negation… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The advent of ever more complex reactive systems in increasingly critical areas calls for the development of automated verication… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
We provide syntactic characterizations for a number of propositional model-based belief revision and update operators proposed in… Expand
Is this relevant?