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)

Related topics

Related topics

50 relations
(SAT, ε-UNSAT)2-satisfiabilityAPXAlgebraic normal form

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Integrated plasma synthesis of efficient catalytic nanostructures for fuel cell electrodes
A single plasma process involving three consecutive steps has been developed for producing high gas flow catalytic nanostructures… 
2006
2006
Carbon Nanofiber Hybrid Actuators: Part I - Liquid Electrolyte-based
This two-part article describes a carbon nanofiber-polymethylmethacrylate (CNF-PMMA) composite material that has electrochemical… 
2006
2006
Optimizing the Initialization of Dynamic Decision Heuristics in DPLL SAT Solvers Using Genetic Programming
The Boolean satisfiability problem (SAT) has many applications in electronic design automation (EDA) as well as theoretical… 
Review
2006
Review
2006
Implementing Survey Propagation on Graphics Processing Units
We show how to exploit the raw power of current graphics processing units (GPUs) to obtain implementations of SAT solving… 
Highly Cited
2004
Highly Cited
2004
Design and implementation of a dual-stage actuated HDD servo system via composite nonlinear control approach
2004
2004
Advanced Formal Verification
Preface. Contributing Authors. Introduction R. Drechsler. 1. Formal Verification. 2. Challenges. 3. Contributions to this Book. 1… 
2003
2003
Using SAT based image computation for reachability analysis
Satisfiability procedures have shown significant promise for symbolic simulation of large circuits, hence they have been used in… 
2000
2000
Conjunctive Normal Form
A statement is in conjunctive normal form if it is a conjunction (sequence of ANDs) consisting of one or more conjuncts, each of… 
1969
1969
Uniformly reflexive structures: On the nature of gödelizations and relative computability
In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract… 
1969
1969
A conjunctive normal form for S3.5
In this note we sketch a decision procedure for S3.51 based on reduction to conjunctive normal form. Using the following theorem… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)