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
2016
Highly Cited
2016
Substantial progress in flexible or stretchable electronics over the past decade has extensively impacted various technologies… 
Highly Cited
2013
Highly Cited
2013
In this paper, the stability analysis of a grid-connected voltage source inverter with an LCL filter is presented. The Poincare… 
Highly Cited
2012
Highly Cited
2012
Algorithms for extraction of Minimally Unsatisfiable Subformulas (MUSes) of CNF formulas find a wide range of practical… 
2000
2000
A statement is in conjunctive normal form if it is a conjunction (sequence of ANDs) consisting of one or more conjuncts, each of… 
Highly Cited
1999
Highly Cited
1999
DNA self-assembly has been proposed as a way to cope with huge combinatorial NP-HARD problems, such as satis ability. However… 
Highly Cited
1991
Highly Cited
1991
A class of concept learning algorithms CL augments standard similarity-based techniques by performing feature construction based… 
Highly Cited
1980