Abstract
Davis-Putnam (DP) [3] was the first practical complete algorithm for solving propositional satisfiability (SAT) problems. DP uses resolution to determine whether a SAT problem instance is satisfiable. However, resolution is generally impractical, as it can use exponential space and time. The most important refinement to DP was DLL [2], which replaced the resolution in DP with backtracking search. Backtracking search still uses exponential time in the worst case, but only needs linear space. As time is more readily available than space, the change to search was a big improvement.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
