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
2010
Highly Cited
2010
Web service composition is a topic bringing several issues to be resolved. Our work deals with the effectiveness and scalability… 
2006
2006
This two-part article describes a carbon nanofiber-polymethylmethacrylate (CNF-PMMA) composite material that has electrochemical… 
2004
2004
Preface. Contributing Authors. Introduction R. Drechsler. 1. Formal Verification. 2. Challenges. 3. Contributions to this Book. 1… 
2003
2003
Satisfiability procedures have shown significant promise for symbolic simulation of large circuits, hence they have been used in… 
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… 
1998
1998
We present some recent results on algorithms for satisfiability of k-CNF formulas: fastest probabilistic algorithms. We mention… 
1994
1994
To estimate population abundance, data were collected from 1,239 black bears (Ursus americanus) trapped in 3 areas of the Smoky… 
Highly Cited
1980