Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Predicate encryption is a new paradigm for public-key encryption that generalizes identity-based encryption and more. In… 
Highly Cited
2009
Highly Cited
2009
Energy expenses are becoming an increasingly important fraction of data center operating costs. At the same time, the energy… 
Highly Cited
2004
Highly Cited
2004
  • Adnan Darwiche
  • European Conference on Artificial Intelligence
  • 2004
  • Corpus ID: 9955285
We describe a new algorithm for compiling conjunctive normal form (CNF) into Deterministic Decomposable Negation Normal (d-DNNF… 
Highly Cited
1999
Highly Cited
1999
The problem of k-SAT is to determine if the given k-CNF has a satisfying solution. It is a celebrated open question as to whether… 
Highly Cited
1998
Highly Cited
1998
Highly Cited
1998
Highly Cited
1998
For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper we… 
Highly Cited
1994
Highly Cited
1994
It has recently been shown that local search is surprisingly good at finding satisfying assignments for certain computationally… 
Highly Cited
1993
Highly Cited
1993
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain classes of CNF… 
Highly Cited
1987
Highly Cited
1979