Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,355,652 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.
Highly Cited
2010
Highly Cited
2010
QoS Aware Semantic Web Service Composition Approach Considering Pre/Postconditions
Peter Bartalos
,
M. Bieliková
IEEE International Conference on Web Services
2010
Corpus ID: 14178973
Web service composition is a topic bringing several issues to be resolved. Our work deals with the effectiveness and scalability…
Expand
2006
2006
Carbon Nanofiber Hybrid Actuators: Part I - Liquid Electrolyte-based
Yun Yeo-Heung
,
Atul Miskin
,
+10 authors
Subrahmin Srivinas
2006
Corpus ID: 44752625
This two-part article describes a carbon nanofiber-polymethylmethacrylate (CNF-PMMA) composite material that has electrochemical…
Expand
Highly Cited
2004
Highly Cited
2004
Design and implementation of a dual-stage actuated HDD servo system via composite nonlinear control approach
K. Peng
,
Ben M. Chen
,
Tong-heng Lee
,
V. Venkataramanan
2004
Corpus ID: 14639516
2004
2004
Advanced Formal Verification
Rolf Drechsler
2004
Corpus ID: 267941382
Preface. Contributing Authors. Introduction R. Drechsler. 1. Formal Verification. 2. Challenges. 3. Contributions to this Book. 1…
Expand
2003
2003
Using SAT based image computation for reachability analysis
P. Chauhan
,
E. Clarke
,
D. Kroening
2003
Corpus ID: 10967400
Satisfiability procedures have shown significant promise for symbolic simulation of large circuits, hence they have been used in…
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
1999
1999
Algorithms for Selective Enumeration of Prime Implicants
L. Palopoli
,
F. Pirri
,
C. Pizzuti
Artificial Intelligence
1999
Corpus ID: 23234734
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
Highly Cited
1980
Highly Cited
1980
Recognizing Disguised NR(1) Instances of the Satisfiability Problem
Bengt Aspvall
J. Algorithms
1980
Corpus ID: 5296270
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)
ACCEPT & CONTINUE