Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,689,022 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.
2016
2016
“Fragmented Sovereignty” over Property Institutions: Developmental Impacts on the Chin Hill Communities
SiuSue Mark
2016
Corpus ID: 157451463
markdownabstractIn a regime in transition with a legacy of civil war, in which institutions that govern a society are often…
Expand
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
SCFG Decoding Without Binarization
Mark Hopkins
,
Greg Langmead
Conference on Empirical Methods in Natural…
2010
Corpus ID: 4895452
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to…
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
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
1994
1994
Estimates of Population Density and Growth of Black Bears in the Smoky Mountains
P. K. McLean
,
M. R. Pelton
1994
Corpus ID: 7950312
To estimate population abundance, data were collected from 1,239 black bears (Ursus americanus) trapped in 3 areas of the Smoky…
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
1969
1969
Uniformly reflexive structures: On the nature of gödelizations and relative computability
E. Wagner
1969
Corpus ID: 399761
In this paper we present an axiomatic theory within which much of the theory of computability can be developed in an abstract…
Expand