Conjunctive normal form

Known as: CNF, Clausal form, 3-CNF 
In Boolean logic, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of clauses, where a clause is a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
∀x (¬P(x) ∨ (∀y (¬P(y) ∨ P(f(x,y))) ∧ ¬∀y (¬Q(x,y) ∨ P(y)))) 3. Reduce scope of negation ∀x (¬P(x) ∨ (∀y (¬P(y) ∨ P(f(x,y))) ∧ ∃y… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The solution to get this book is that we don't over you the free book. But, we offer you the free information about principles of… (More)
Is this relevant?
2006
2006
There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We consider the satisfiability problem on Boolean formulas in conjunctive normal form. We that a satisfying assignment of a… (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?
2003
2003
We study homomorphisms of propositional formulas in CNF generalizing symmetries considered by Krishnamurthy. If φ : H → F is a… (More)
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?
2000
2000
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
REPORTRAPPORT A linear-time transformation of linear inequalities into conjunctive normal form Abstract We present a technique… (More)
Is this relevant?