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 Energy Control Strategy Design for a Hybrid Electric Vehicle
A heavy-duty parallel hybrid electric truck is modeled, and its optimal energy control is studied in this paper. The fundamental… 
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… 
2012
2012
Algorithms for Gate Sizing and Device Parameter Selection for High-Performance Designs
It is becoming increasingly important to design high-performance circuits with as low power as possible. In this paper, we study… 
Highly Cited
2012
Highly Cited
2012
Optimal Target Channel Sequence Design for Multiple Spectrum Handoffs in Cognitive Radio Networks
In this paper, we investigate how to determine an optimal target channel sequence with the minimum cumulative handoff delay in… 
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… 
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… 
1993
1993
Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems
Maximum satissability (MAX-SAT) is an extension of satissability (SAT), in which a partial solution is sought that satisses the… 
1990
1990
Some tools for approximate 3-coloring
  • Avrim Blum
  • Proceedings [] 31st Annual Symposium on…
  • 1990
  • Corpus ID: 206658694
Several tools for use in approximation algorithms to color 3-chromatic graphs are presented. The techniques are used in an… 
1981
1981
ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA
DUAL CRJ:TERIA Shigeji Miyazaki University of Osaka Prefecture (Received January 12, 1980; Revised August 28,1980) In this paper… 
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)