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.
2005
2005
The IJCAR-2004 Automated Theorem Proving Competition
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems… 
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… 
Highly Cited
1999
Highly Cited
1999
2D DNA self-assembly for satisfiability
DNA self-assembly has been proposed as a way to cope with huge combinatorial NP-HARD problems, such as satis ability. However… 
1999
1999
Algorithms for Selective Enumeration of Prime Implicants
Highly Cited
1998
Highly Cited
1998
On Generating Small Clause Normal Forms
In this paper we focus on two powerful techniques to obtain compact clause normal forms: Renaming of formulae and refined… 
1998
1998
Satisfiability - Algorithms and Logic
We present some recent results on algorithms for satisfiability of k-CNF formulas: fastest probabilistic algorithms. We mention… 
Highly Cited
1980
Highly Cited
1980
Recognizing Disguised NR(1) Instances of the Satisfiability Problem
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)