Skip to search formSkip to main contentSkip to account menu

Davis–Putnam algorithm

Known as: David-Putnam algorithm, Davis-Putnam-method, Davis-Putnam procedure 
The Davis–Putnam algorithm was developed by Martin Davis and Hilary Putnam for checking the validity of a first-order logic formula using a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
2-satisfiabilityCommunications of the ACMConflict-Driven Clause LearningDPLL algorithm

Broader (3)

Automated theorem provingBoolean algebraConstraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Modeling Occlusion by Discriminative AND-OR Structures
Occlusion presents a challenge for detecting objects in real world applications. To address this issue, this paper models object… 
2013
2013
Optimal guard-band-aware channel assignment with bonding and aggregation in multi-channel systems
Channel assignment mechanisms in multi-channel wireless networks are often designed without accounting for adjacent-channel… 
2011
2011
The improved Douglas-Peucker algorithm based on the contour character
Compared with the common line-simple algorithm, contour generalization pays more attention on the spatial relationship and… 
2010
2010
Three-Dimensional Semiautomatic Road Extraction From a High-Resolution Aerial Image by Dynamic-Programming Optimization in the Object Space
This letter proposes a method for 3-D semiautomatic road extraction from a single image by dynamic programming (DP), which… 
2007
2007
Impact of Mobility on the BER Performance of Ad Hoc Wireless Networks
In this paper, the authors quantify the impact of mobility on the bit error rate (BER) performance of ad hoc wireless networks… 
Highly Cited
2002
Highly Cited
2002
Optimization of Power Management Strategies for a Hydraulic Hybrid Medium Truck
This paper investigates development of power management strategies tailored specifically to a medium truck with parallel… 
1999
1999
Phase Transitions in the Regular Random 3-SAT Problem
In this paper we investigate phase transitions in the random 3-SAT problem but we move from the usual setting of classical logic… 
Highly Cited
1999
Highly Cited
1999
An empirical analysis of modal theorem provers
ABSTRACT This paper reports on an empirical performance analysis of four modal theorem provers on benchmark suites of randomly… 
1995
1995
Theoretical Analysis of Davis-Putnam Procedure and Propositional Satisfiability
This paper presents a statistical analysis of the Davis-Putnam procedure and propositional satisfiability problems (SAT). SAT has… 
1990
1990
Detection and tracking of low-observable targets through dynamic programming
  • J. Arnold
  • Defense + Commercial Sensing
  • 1990
  • Corpus ID: 67244022
A dynamic programming (DP) technique has been developed for the detection of subpixel-sized, low-SNR targets observed by mosaic… 
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)