Davis–Putnam algorithm
Davis–Putnam algorithm is an algorithm for check the validity of a logic formula.
All 3 facts, and where they come from
Facts
3 facts · 0 confirmed by two sources · 0 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2569330285
- Described as
- algorithm for check the validity of a logic formula
- Other names
- Davis-Putnam algorithm, Davis–Putnam procedure
- What it is
- algorithm
- Named after
- Martin Davis; Hilary Putnam
- Wikipedias with a page
- 11
Wikidata item Q1177898 (wikidata.org/wiki/Q1177898), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1341841193
In logic and computer science, the Davis–Putnam algorithm was developed by Martin Davis and Hilary Putnam for checking the validity of a first-order logic formula using a resolution-based decision procedure for propositional logic. Since the set of valid first-order formulas is recursively enumerable but not recursive, there exists no general algorithm to solve this problem. Therefore, the Davis–Putnam algorithm only terminates on valid formulas. Today, the term "Davis–Putnam algorithm" is often used synonymously with the resolution-based propositional decision procedure (Davis–Putnam procedure) that is actually only one of the steps of the original algorithm.
From the Wikipedia article “Davis–Putnam algorithm” (en.wikipedia.org/wiki/Davis–Putnam_algorithm), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
