A Machine Program for Theorem-Proving

Davis, M., Logemann, G., & Loveland, D. (1962). A Machine Program for Theorem-Proving. Communications of the ACM, 394-397.

Type

Journal article

Intellectual base

Primary research

Year

1962

Pages

394-397

DOI

10.1145/368273.368557

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/368273.368557

Cited by

1 citation across 1 artifact.

Domain-specific

• Davis–Putnam Algorithm
  • DPLL replaces the potentially explosive exhaustive-resolution elimination step with case splitting and backtracking, while retaining unit propagation and related simplifications.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:6d713dddf221 · see in the full table