Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,983,700 papers from all fields of science
Search
Sign In
Create Free Account
Conjunctive normal form
Known as:
CNF
, Clausal form
, 3-CNF
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
(SAT, ε-UNSAT)
2-satisfiability
APX
Algebraic normal form
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Mining Comprehensible and Interesting Rules: A Genetic Algorithm Approach
J. Vashishtha
,
Dharminder Kumar
,
S. Ratnoo
,
K. Kundu
2011
Corpus ID: 8567447
A majority of contribution in the domain of rule mining overemphasize on maximizing the predictive accuracy of the discovered…
Expand
2010
2010
Semantic diff as the basis for knowledge base versioning
Enrico Franconi
,
T. Meyer
,
I. Varzinczak
2010
Corpus ID: 16407877
13th International Workshop on Non-Monotonic Reasoning (NMR). 14-16 May 2010, Toronto, Canada
2010
2010
Information About a Given Entity: From Semantics Towards Automated Deduction
R. Demolombe
,
L. F. D. Cerro
Journal of Logic and Computation
2010
Corpus ID: 1460507
The standard method to retrieve information can be formally defined as follows. To ask a query, one gives the properties of the…
Expand
2010
2010
Antioxidative Activity of Carbon Nanotube and Nanofiber
E. Zeynalov
,
J. Friedrich
2010
Corpus ID: 17238251
Carbon nanotubes (CNTs) and carbon nanofibers (CNFs) have electron affinities similar to those of fullerenes C60 and C70 and they…
Expand
2004
2004
Principal Disjunctive and Conjunctive Normal Form
Zhang Xing-dai
2004
Corpus ID: 124720636
This paper studied the operational nature of Maxiterm and Minterm, using these nature Principal, given Disjunctive and…
Expand
2000
2000
Conjunctive Normal Form
E. Weisstein
2000
Corpus ID: 146054657
A statement is in conjunctive normal form if it is a conjunction (sequence of ANDs) consisting of one or more conjuncts, each of…
Expand
2000
2000
DES: a Challenge Problem for Nonmonotonic Reasoning Systems
M. Hietalahti
,
F. Massacci
,
I. Niemelä
arXiv.org
2000
Corpus ID: 4728033
The US Data Encryption Standard, DES for short, is put forward as an interesting benchmark problem for nonmonotonic reasoning…
Expand
1998
1998
Satisfiability - Algorithms and Logic
P. Pudlák
International Symposium on Mathematical…
1998
Corpus ID: 729986
We present some recent results on algorithms for satisfiability of k-CNF formulas: fastest probabilistic algorithms. We mention…
Expand
1991
1991
Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
J. Franco
SIAM journal on computing (Print)
1991
Corpus ID: 12166207
Preprocessing a random instance I of CNF Satisfiability in order to remove infrequent variables (those which appear once or twice…
Expand
1969
1969
A conjunctive normal form for S3.5
M. Cresswell
Journal of Symbolic Logic (JSL)
1969
Corpus ID: 45804716
In this note we sketch a decision procedure for S3.51 based on reduction to conjunctive normal form. Using the following theorem…
Expand