Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,531,638 papers from all fields of science
Search
Sign In
Create Free Account
Davis–Putnam algorithm
Known as:
David-Putnam algorithm
, Davis-Putnam-method
, Davis-Putnam procedure
Expand
The Davis–Putnam algorithm was developed by Martin Davis and Hilary Putnam for checking the validity of a first-order logic formula using a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
2-satisfiability
Communications of the ACM
Conflict-Driven Clause Learning
DPLL algorithm
Expand
Broader (3)
Automated theorem proving
Boolean algebra
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Static probabilistic timing analysis for real-time systems using random replacement caches
S. Altmeyer
,
L. Cucu-Grosjean
,
Robert I. Davis
Real-time systems
2015
Corpus ID: 14331658
In this paper, we investigate static probabilistic timing analysis (SPTA) for single processor real-time systems that use a cache…
Expand
2013
2013
Modeling Occlusion by Discriminative AND-OR Structures
Bo Li
,
Wenze Hu
,
Tianfu Wu
,
Song-Chun Zhu
IEEE International Conference on Computer Vision
2013
Corpus ID: 16064079
Occlusion presents a challenge for detecting objects in real world applications. To address this issue, this paper models object…
Expand
2013
2013
Optimal Energy Control Strategy Design for a Hybrid Electric Vehicle
Y. Zou
,
Shi-jie Hou
,
Dong-ge Li
,
Gao Wei
,
Xiaosong Hu
2013
Corpus ID: 19501262
A heavy-duty parallel hybrid electric truck is modeled, and its optimal energy control is studied in this paper. The fundamental…
Expand
2013
2013
Optimal guard-band-aware channel assignment with bonding and aggregation in multi-channel systems
Gulnur Selda Uyanik
,
Mohammad J. Abdel Rahman
,
M. Krunz
IEEE Globecom Workshops (GC Wkshps)
2013
Corpus ID: 13008971
Channel assignment mechanisms in multi-channel wireless networks are often designed without accounting for adjacent-channel…
Expand
2012
2012
Algorithms for Gate Sizing and Device Parameter Selection for High-Performance Designs
Muhammet Mustafa Ozdal
,
S. Burns
,
Jiang Hu
IEEE Transactions on Computer-Aided Design of…
2012
Corpus ID: 18850359
It is becoming increasingly important to design high-performance circuits with as low power as possible. In this paper, we study…
Expand
Highly Cited
2002
Highly Cited
2002
Optimization of Power Management Strategies for a Hydraulic Hybrid Medium Truck
Bin Wu
,
Chan-Chiao Lin
,
Z. Filipi
,
H. Peng
,
D. Assanis
2002
Corpus ID: 15662673
This paper investigates development of power management strategies tailored specifically to a medium truck with parallel…
Expand
1999
1999
Phase Transitions in the Regular Random 3-SAT Problem
R. Béjar
,
F. Manyà
International Syposium on Methodologies for…
1999
Corpus ID: 37427803
In this paper we investigate phase transitions in the random 3-SAT problem but we move from the usual setting of classical logic…
Expand
1998
1998
Capital account regimes and the developing countries
G. Helleiner
1998
Corpus ID: 17715076
List of Figures - List of Tables - Notes on the Contributors - Preface to the 1999 Reprint - List of Abbreviations - Capital…
Expand
1995
1995
Theoretical Analysis of Davis-Putnam Procedure and Propositional Satisfiability
N. Yugami
International Joint Conference on Artificial…
1995
Corpus ID: 11736544
This paper presents a statistical analysis of the Davis-Putnam procedure and propositional satisfiability problems (SAT). SAT has…
Expand
1995
1995
GSAT and Local Consistency
Kalev Kask
,
R. Dechter
International Joint Conference on Artificial…
1995
Corpus ID: 14596049
It has been shown that hill-climbing constraint satisfaction methods like min-conflicts [Minton et al., 1990] and GSAT [Selman et…
Expand
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